java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/psyco/psyco_security_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 15:27:00,489 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 15:27:00,491 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 15:27:00,503 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 15:27:00,503 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 15:27:00,504 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 15:27:00,506 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 15:27:00,507 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 15:27:00,509 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 15:27:00,510 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 15:27:00,511 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 15:27:00,511 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 15:27:00,512 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 15:27:00,513 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 15:27:00,514 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 15:27:00,515 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 15:27:00,516 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 15:27:00,518 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 15:27:00,520 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 15:27:00,521 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 15:27:00,522 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 15:27:00,526 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 15:27:00,531 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 15:27:00,532 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 15:27:00,534 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 15:27:00,535 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 15:27:00,536 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 15:27:00,537 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 15:27:00,540 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 15:27:00,542 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 15:27:00,542 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 15:27:00,542 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 15:27:00,543 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 15:27:00,543 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 15:27:00,545 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 15:27:00,546 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 15:27:00,546 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-10-27 15:27:00,574 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 15:27:00,574 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 15:27:00,575 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 15:27:00,576 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 15:27:00,576 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 15:27:00,576 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 15:27:00,576 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 15:27:00,576 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 15:27:00,577 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 15:27:00,577 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 15:27:00,577 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 15:27:00,577 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 15:27:00,578 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 15:27:00,578 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 15:27:00,579 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 15:27:00,579 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 15:27:00,579 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 15:27:00,579 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 15:27:00,579 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 15:27:00,580 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 15:27:00,581 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 15:27:00,581 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 15:27:00,582 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 15:27:00,582 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 15:27:00,582 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 15:27:00,582 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 15:27:00,583 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 15:27:00,583 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 15:27:00,583 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 15:27:00,583 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 15:27:00,583 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 15:27:00,583 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 15:27:00,584 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 15:27:00,584 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 15:27:00,650 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 15:27:00,669 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 15:27:00,672 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 15:27:00,673 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 15:27:00,674 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 15:27:00,675 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/psyco/psyco_security_true-unreach-call_false-termination.c [2018-10-27 15:27:00,729 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/74ce26d3a/cd5d8ba7717a4232a270d067db2faee5/FLAGe63a7d2c5 [2018-10-27 15:27:01,195 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 15:27:01,196 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_security_true-unreach-call_false-termination.c [2018-10-27 15:27:01,207 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/74ce26d3a/cd5d8ba7717a4232a270d067db2faee5/FLAGe63a7d2c5 [2018-10-27 15:27:01,227 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/74ce26d3a/cd5d8ba7717a4232a270d067db2faee5 [2018-10-27 15:27:01,240 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 15:27:01,242 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 15:27:01,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 15:27:01,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 15:27:01,247 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 15:27:01,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 03:27:01" (1/1) ... [2018-10-27 15:27:01,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13070873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:01, skipping insertion in model container [2018-10-27 15:27:01,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 03:27:01" (1/1) ... [2018-10-27 15:27:01,262 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 15:27:01,314 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 15:27:01,534 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 15:27:01,539 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 15:27:01,578 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 15:27:01,599 INFO L193 MainTranslator]: Completed translation [2018-10-27 15:27:01,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:01 WrapperNode [2018-10-27 15:27:01,600 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 15:27:01,601 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 15:27:01,601 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 15:27:01,601 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 15:27:01,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:01" (1/1) ... [2018-10-27 15:27:01,615 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:01" (1/1) ... [2018-10-27 15:27:01,632 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 15:27:01,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 15:27:01,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 15:27:01,633 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 15:27:01,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:01" (1/1) ... [2018-10-27 15:27:01,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:01" (1/1) ... [2018-10-27 15:27:01,646 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:01" (1/1) ... [2018-10-27 15:27:01,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:01" (1/1) ... [2018-10-27 15:27:01,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:01" (1/1) ... [2018-10-27 15:27:01,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:01" (1/1) ... [2018-10-27 15:27:01,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:01" (1/1) ... [2018-10-27 15:27:01,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 15:27:01,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 15:27:01,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 15:27:01,687 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 15:27:01,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 15:27:01,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 15:27:01,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 15:27:01,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 15:27:01,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 15:27:01,823 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 15:27:01,824 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 15:27:02,633 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 15:27:02,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 03:27:02 BoogieIcfgContainer [2018-10-27 15:27:02,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 15:27:02,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 15:27:02,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 15:27:02,643 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 15:27:02,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 03:27:01" (1/3) ... [2018-10-27 15:27:02,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2021ca93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 03:27:02, skipping insertion in model container [2018-10-27 15:27:02,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:01" (2/3) ... [2018-10-27 15:27:02,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2021ca93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 03:27:02, skipping insertion in model container [2018-10-27 15:27:02,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 03:27:02" (3/3) ... [2018-10-27 15:27:02,647 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_security_true-unreach-call_false-termination.c [2018-10-27 15:27:02,655 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 15:27:02,664 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 15:27:02,677 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 15:27:02,710 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 15:27:02,711 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 15:27:02,711 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 15:27:02,711 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 15:27:02,711 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 15:27:02,712 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 15:27:02,712 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 15:27:02,712 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 15:27:02,732 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states. [2018-10-27 15:27:02,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-27 15:27:02,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:02,739 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:27:02,741 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:02,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:02,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1921368221, now seen corresponding path program 1 times [2018-10-27 15:27:02,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:02,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:02,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:02,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:02,794 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:02,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:02,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 15:27:02,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 15:27:02,876 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:27:02,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 15:27:02,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 15:27:02,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 15:27:02,900 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 2 states. [2018-10-27 15:27:02,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:02,931 INFO L93 Difference]: Finished difference Result 160 states and 298 transitions. [2018-10-27 15:27:02,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 15:27:02,933 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-10-27 15:27:02,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:02,946 INFO L225 Difference]: With dead ends: 160 [2018-10-27 15:27:02,946 INFO L226 Difference]: Without dead ends: 78 [2018-10-27 15:27:02,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 15:27:02,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-27 15:27:02,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-10-27 15:27:02,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-27 15:27:02,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 113 transitions. [2018-10-27 15:27:02,999 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 113 transitions. Word has length 13 [2018-10-27 15:27:02,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:02,999 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 113 transitions. [2018-10-27 15:27:02,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 15:27:03,000 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2018-10-27 15:27:03,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-27 15:27:03,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:03,001 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:27:03,001 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:03,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:03,002 INFO L82 PathProgramCache]: Analyzing trace with hash -34635363, now seen corresponding path program 1 times [2018-10-27 15:27:03,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:03,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:03,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:03,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:03,004 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:03,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:03,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 15:27:03,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 15:27:03,083 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:27:03,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 15:27:03,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 15:27:03,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 15:27:03,090 INFO L87 Difference]: Start difference. First operand 78 states and 113 transitions. Second operand 3 states. [2018-10-27 15:27:03,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:03,338 INFO L93 Difference]: Finished difference Result 153 states and 224 transitions. [2018-10-27 15:27:03,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 15:27:03,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-27 15:27:03,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:03,341 INFO L225 Difference]: With dead ends: 153 [2018-10-27 15:27:03,341 INFO L226 Difference]: Without dead ends: 81 [2018-10-27 15:27:03,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 15:27:03,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-27 15:27:03,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-10-27 15:27:03,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-27 15:27:03,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 116 transitions. [2018-10-27 15:27:03,352 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 116 transitions. Word has length 14 [2018-10-27 15:27:03,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:03,352 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 116 transitions. [2018-10-27 15:27:03,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 15:27:03,353 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 116 transitions. [2018-10-27 15:27:03,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-27 15:27:03,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:03,354 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:27:03,354 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:03,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:03,355 INFO L82 PathProgramCache]: Analyzing trace with hash -304388480, now seen corresponding path program 1 times [2018-10-27 15:27:03,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:03,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:03,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:03,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:03,356 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:03,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:03,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 15:27:03,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 15:27:03,418 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:27:03,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 15:27:03,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 15:27:03,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 15:27:03,419 INFO L87 Difference]: Start difference. First operand 81 states and 116 transitions. Second operand 3 states. [2018-10-27 15:27:03,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:03,671 INFO L93 Difference]: Finished difference Result 146 states and 213 transitions. [2018-10-27 15:27:03,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 15:27:03,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-27 15:27:03,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:03,674 INFO L225 Difference]: With dead ends: 146 [2018-10-27 15:27:03,674 INFO L226 Difference]: Without dead ends: 72 [2018-10-27 15:27:03,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 15:27:03,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-27 15:27:03,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-10-27 15:27:03,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-27 15:27:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2018-10-27 15:27:03,683 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 102 transitions. Word has length 19 [2018-10-27 15:27:03,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:03,684 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 102 transitions. [2018-10-27 15:27:03,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 15:27:03,685 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 102 transitions. [2018-10-27 15:27:03,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-27 15:27:03,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:03,686 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:27:03,686 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:03,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:03,687 INFO L82 PathProgramCache]: Analyzing trace with hash -512664072, now seen corresponding path program 1 times [2018-10-27 15:27:03,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:03,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:03,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:03,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:03,688 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:03,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:03,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 15:27:03,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 15:27:03,751 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:27:03,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 15:27:03,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 15:27:03,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 15:27:03,752 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. Second operand 3 states. [2018-10-27 15:27:04,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:04,017 INFO L93 Difference]: Finished difference Result 192 states and 280 transitions. [2018-10-27 15:27:04,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 15:27:04,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-27 15:27:04,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:04,020 INFO L225 Difference]: With dead ends: 192 [2018-10-27 15:27:04,021 INFO L226 Difference]: Without dead ends: 122 [2018-10-27 15:27:04,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 15:27:04,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-27 15:27:04,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2018-10-27 15:27:04,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-27 15:27:04,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2018-10-27 15:27:04,035 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 22 [2018-10-27 15:27:04,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:04,036 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2018-10-27 15:27:04,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 15:27:04,036 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2018-10-27 15:27:04,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-27 15:27:04,037 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:04,037 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:27:04,038 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:04,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:04,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1940953662, now seen corresponding path program 1 times [2018-10-27 15:27:04,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:04,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:04,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:04,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:04,040 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:04,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:04,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 15:27:04,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 15:27:04,108 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:27:04,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 15:27:04,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 15:27:04,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 15:27:04,111 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand 3 states. [2018-10-27 15:27:04,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:04,175 INFO L93 Difference]: Finished difference Result 183 states and 260 transitions. [2018-10-27 15:27:04,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 15:27:04,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-27 15:27:04,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:04,177 INFO L225 Difference]: With dead ends: 183 [2018-10-27 15:27:04,177 INFO L226 Difference]: Without dead ends: 87 [2018-10-27 15:27:04,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 15:27:04,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-27 15:27:04,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-10-27 15:27:04,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-27 15:27:04,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2018-10-27 15:27:04,188 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 23 [2018-10-27 15:27:04,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:04,188 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2018-10-27 15:27:04,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 15:27:04,189 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2018-10-27 15:27:04,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-27 15:27:04,190 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:04,190 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:27:04,191 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:04,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:04,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1172052595, now seen corresponding path program 1 times [2018-10-27 15:27:04,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:04,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:04,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:04,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:04,193 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:04,274 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 15:27:04,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 15:27:04,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 15:27:04,275 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:27:04,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 15:27:04,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 15:27:04,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 15:27:04,277 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand 3 states. [2018-10-27 15:27:04,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:04,342 INFO L93 Difference]: Finished difference Result 134 states and 190 transitions. [2018-10-27 15:27:04,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 15:27:04,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-10-27 15:27:04,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:04,347 INFO L225 Difference]: With dead ends: 134 [2018-10-27 15:27:04,347 INFO L226 Difference]: Without dead ends: 70 [2018-10-27 15:27:04,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 15:27:04,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-27 15:27:04,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-10-27 15:27:04,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-27 15:27:04,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2018-10-27 15:27:04,363 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 29 [2018-10-27 15:27:04,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:04,364 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2018-10-27 15:27:04,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 15:27:04,364 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2018-10-27 15:27:04,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-27 15:27:04,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:04,369 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:27:04,369 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:04,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:04,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1320221367, now seen corresponding path program 1 times [2018-10-27 15:27:04,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:04,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:04,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:04,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:04,376 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:04,440 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 15:27:04,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 15:27:04,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 15:27:04,441 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:27:04,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 15:27:04,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 15:27:04,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 15:27:04,443 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand 3 states. [2018-10-27 15:27:04,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:04,810 INFO L93 Difference]: Finished difference Result 158 states and 228 transitions. [2018-10-27 15:27:04,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 15:27:04,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-27 15:27:04,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:04,812 INFO L225 Difference]: With dead ends: 158 [2018-10-27 15:27:04,812 INFO L226 Difference]: Without dead ends: 111 [2018-10-27 15:27:04,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 15:27:04,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-27 15:27:04,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2018-10-27 15:27:04,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-27 15:27:04,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2018-10-27 15:27:04,822 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 30 [2018-10-27 15:27:04,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:04,823 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2018-10-27 15:27:04,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 15:27:04,823 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2018-10-27 15:27:04,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-27 15:27:04,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:04,825 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:27:04,825 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:04,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:04,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1121323394, now seen corresponding path program 1 times [2018-10-27 15:27:04,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:04,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:04,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:04,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:04,827 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:04,894 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 15:27:04,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 15:27:04,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 15:27:04,895 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:27:04,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 15:27:04,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 15:27:04,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 15:27:04,897 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand 3 states. [2018-10-27 15:27:05,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:05,023 INFO L93 Difference]: Finished difference Result 166 states and 232 transitions. [2018-10-27 15:27:05,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 15:27:05,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-27 15:27:05,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:05,028 INFO L225 Difference]: With dead ends: 166 [2018-10-27 15:27:05,028 INFO L226 Difference]: Without dead ends: 92 [2018-10-27 15:27:05,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 15:27:05,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-27 15:27:05,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-10-27 15:27:05,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-27 15:27:05,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 120 transitions. [2018-10-27 15:27:05,038 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 120 transitions. Word has length 31 [2018-10-27 15:27:05,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:05,038 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 120 transitions. [2018-10-27 15:27:05,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 15:27:05,039 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2018-10-27 15:27:05,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-27 15:27:05,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:05,040 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:27:05,041 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:05,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:05,041 INFO L82 PathProgramCache]: Analyzing trace with hash -984969239, now seen corresponding path program 1 times [2018-10-27 15:27:05,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:05,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:05,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:05,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:05,043 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:05,076 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 15:27:05,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 15:27:05,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 15:27:05,077 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:27:05,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 15:27:05,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 15:27:05,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 15:27:05,078 INFO L87 Difference]: Start difference. First operand 92 states and 120 transitions. Second operand 3 states. [2018-10-27 15:27:05,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:05,146 INFO L93 Difference]: Finished difference Result 139 states and 184 transitions. [2018-10-27 15:27:05,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 15:27:05,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-27 15:27:05,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:05,148 INFO L225 Difference]: With dead ends: 139 [2018-10-27 15:27:05,148 INFO L226 Difference]: Without dead ends: 72 [2018-10-27 15:27:05,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 15:27:05,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-27 15:27:05,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-10-27 15:27:05,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-27 15:27:05,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2018-10-27 15:27:05,155 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 31 [2018-10-27 15:27:05,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:05,155 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2018-10-27 15:27:05,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 15:27:05,156 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2018-10-27 15:27:05,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-27 15:27:05,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:05,157 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:27:05,157 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:05,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:05,158 INFO L82 PathProgramCache]: Analyzing trace with hash 885900628, now seen corresponding path program 1 times [2018-10-27 15:27:05,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:05,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:05,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:05,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:05,159 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:05,202 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 15:27:05,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 15:27:05,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 15:27:05,203 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:27:05,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 15:27:05,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 15:27:05,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 15:27:05,204 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand 3 states. [2018-10-27 15:27:05,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:05,420 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2018-10-27 15:27:05,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 15:27:05,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-10-27 15:27:05,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:05,421 INFO L225 Difference]: With dead ends: 74 [2018-10-27 15:27:05,421 INFO L226 Difference]: Without dead ends: 70 [2018-10-27 15:27:05,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 15:27:05,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-27 15:27:05,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-10-27 15:27:05,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-27 15:27:05,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2018-10-27 15:27:05,427 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 32 [2018-10-27 15:27:05,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:05,428 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2018-10-27 15:27:05,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 15:27:05,428 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2018-10-27 15:27:05,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-27 15:27:05,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:05,430 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:27:05,430 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:05,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:05,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1704565915, now seen corresponding path program 1 times [2018-10-27 15:27:05,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:05,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:05,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:05,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:05,432 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 15:27:05,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 15:27:05,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 15:27:05,492 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:27:05,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 15:27:05,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 15:27:05,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 15:27:05,493 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 3 states. [2018-10-27 15:27:05,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:05,537 INFO L93 Difference]: Finished difference Result 111 states and 143 transitions. [2018-10-27 15:27:05,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 15:27:05,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-10-27 15:27:05,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:05,538 INFO L225 Difference]: With dead ends: 111 [2018-10-27 15:27:05,538 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 15:27:05,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 15:27:05,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 15:27:05,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 15:27:05,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 15:27:05,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 15:27:05,541 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-10-27 15:27:05,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:05,541 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 15:27:05,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 15:27:05,541 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 15:27:05,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 15:27:05,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 15:27:05,702 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-27 15:27:05,702 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-10-27 15:27:05,703 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 15:27:05,703 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 15:27:05,703 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-27 15:27:05,703 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 15:27:05,703 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 15:27:05,703 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 331) no Hoare annotation was computed. [2018-10-27 15:27:05,703 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 382) no Hoare annotation was computed. [2018-10-27 15:27:05,703 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 261) no Hoare annotation was computed. [2018-10-27 15:27:05,704 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 13 390) no Hoare annotation was computed. [2018-10-27 15:27:05,704 INFO L425 ceAbstractionStarter]: For program point L184(lines 184 199) no Hoare annotation was computed. [2018-10-27 15:27:05,704 INFO L425 ceAbstractionStarter]: For program point L118(lines 118 129) no Hoare annotation was computed. [2018-10-27 15:27:05,704 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 377) no Hoare annotation was computed. [2018-10-27 15:27:05,704 INFO L425 ceAbstractionStarter]: For program point L300(lines 300 315) no Hoare annotation was computed. [2018-10-27 15:27:05,704 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 245) no Hoare annotation was computed. [2018-10-27 15:27:05,704 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 113) no Hoare annotation was computed. [2018-10-27 15:27:05,704 INFO L425 ceAbstractionStarter]: For program point L350(lines 350 361) no Hoare annotation was computed. [2018-10-27 15:27:05,704 INFO L425 ceAbstractionStarter]: For program point L284(lines 284 299) no Hoare annotation was computed. [2018-10-27 15:27:05,705 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 229) no Hoare annotation was computed. [2018-10-27 15:27:05,705 INFO L425 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2018-10-27 15:27:05,705 INFO L425 ceAbstractionStarter]: For program point L334(lines 334 345) no Hoare annotation was computed. [2018-10-27 15:27:05,705 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 213) no Hoare annotation was computed. [2018-10-27 15:27:05,705 INFO L425 ceAbstractionStarter]: For program point L70(lines 70 72) no Hoare annotation was computed. [2018-10-27 15:27:05,705 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 329) no Hoare annotation was computed. [2018-10-27 15:27:05,705 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 197) no Hoare annotation was computed. [2018-10-27 15:27:05,706 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 56) no Hoare annotation was computed. [2018-10-27 15:27:05,706 INFO L425 ceAbstractionStarter]: For program point L302(lines 302 313) no Hoare annotation was computed. [2018-10-27 15:27:05,706 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 13 390) no Hoare annotation was computed. [2018-10-27 15:27:05,706 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 172) no Hoare annotation was computed. [2018-10-27 15:27:05,706 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 297) no Hoare annotation was computed. [2018-10-27 15:27:05,706 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 156) no Hoare annotation was computed. [2018-10-27 15:27:05,706 INFO L421 ceAbstractionStarter]: At program point L22-3(lines 22 385) the Hoare annotation is: (or (and (<= main_~this_state~0 0) (= main_~q~0 0)) (and (= main_~this_state~0 3) (<= 4 main_~q~0))) [2018-10-27 15:27:05,706 INFO L425 ceAbstractionStarter]: For program point L22-4(lines 22 385) no Hoare annotation was computed. [2018-10-27 15:27:05,706 INFO L425 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2018-10-27 15:27:05,707 INFO L425 ceAbstractionStarter]: For program point L138(lines 138 140) no Hoare annotation was computed. [2018-10-27 15:27:05,707 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 256) no Hoare annotation was computed. [2018-10-27 15:27:05,707 INFO L425 ceAbstractionStarter]: For program point L122(lines 122 124) no Hoare annotation was computed. [2018-10-27 15:27:05,707 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 372) no Hoare annotation was computed. [2018-10-27 15:27:05,707 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 240) no Hoare annotation was computed. [2018-10-27 15:27:05,707 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 108) no Hoare annotation was computed. [2018-10-27 15:27:05,707 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 356) no Hoare annotation was computed. [2018-10-27 15:27:05,707 INFO L425 ceAbstractionStarter]: For program point L222(lines 222 224) no Hoare annotation was computed. [2018-10-27 15:27:05,708 INFO L421 ceAbstractionStarter]: At program point L371(lines 13 390) the Hoare annotation is: false [2018-10-27 15:27:05,708 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 340) no Hoare annotation was computed. [2018-10-27 15:27:05,708 INFO L425 ceAbstractionStarter]: For program point L206(lines 206 208) no Hoare annotation was computed. [2018-10-27 15:27:05,708 INFO L425 ceAbstractionStarter]: For program point L322(lines 322 324) no Hoare annotation was computed. [2018-10-27 15:27:05,708 INFO L425 ceAbstractionStarter]: For program point L190(lines 190 192) no Hoare annotation was computed. [2018-10-27 15:27:05,708 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 308) no Hoare annotation was computed. [2018-10-27 15:27:05,708 INFO L425 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2018-10-27 15:27:05,709 INFO L425 ceAbstractionStarter]: For program point L27(lines 27 46) no Hoare annotation was computed. [2018-10-27 15:27:05,709 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 389) no Hoare annotation was computed. [2018-10-27 15:27:05,709 INFO L425 ceAbstractionStarter]: For program point L28(lines 28 43) no Hoare annotation was computed. [2018-10-27 15:27:05,709 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 41) no Hoare annotation was computed. [2018-10-27 15:27:05,709 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 13 390) the Hoare annotation is: true [2018-10-27 15:27:05,709 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 95) no Hoare annotation was computed. [2018-10-27 15:27:05,710 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 98) no Hoare annotation was computed. [2018-10-27 15:27:05,710 INFO L425 ceAbstractionStarter]: For program point L64(lines 64 79) no Hoare annotation was computed. [2018-10-27 15:27:05,710 INFO L425 ceAbstractionStarter]: For program point L48(lines 48 63) no Hoare annotation was computed. [2018-10-27 15:27:05,710 INFO L425 ceAbstractionStarter]: For program point L164(lines 164 179) no Hoare annotation was computed. [2018-10-27 15:27:05,710 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 163) no Hoare annotation was computed. [2018-10-27 15:27:05,710 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 93) no Hoare annotation was computed. [2018-10-27 15:27:05,710 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 279) no Hoare annotation was computed. [2018-10-27 15:27:05,711 INFO L425 ceAbstractionStarter]: For program point L132(lines 132 147) no Hoare annotation was computed. [2018-10-27 15:27:05,711 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 182) no Hoare annotation was computed. [2018-10-27 15:27:05,711 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 77) no Hoare annotation was computed. [2018-10-27 15:27:05,711 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 263) no Hoare annotation was computed. [2018-10-27 15:27:05,711 INFO L425 ceAbstractionStarter]: For program point L116(lines 116 131) no Hoare annotation was computed. [2018-10-27 15:27:05,711 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 61) no Hoare annotation was computed. [2018-10-27 15:27:05,711 INFO L425 ceAbstractionStarter]: For program point L364(lines 364 379) no Hoare annotation was computed. [2018-10-27 15:27:05,712 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 247) no Hoare annotation was computed. [2018-10-27 15:27:05,712 INFO L425 ceAbstractionStarter]: For program point L166(lines 166 177) no Hoare annotation was computed. [2018-10-27 15:27:05,712 INFO L425 ceAbstractionStarter]: For program point L100(lines 100 115) no Hoare annotation was computed. [2018-10-27 15:27:05,712 INFO L425 ceAbstractionStarter]: For program point L34(lines 34 36) no Hoare annotation was computed. [2018-10-27 15:27:05,712 INFO L421 ceAbstractionStarter]: At program point L381(lines 22 385) the Hoare annotation is: (let ((.cse0 (<= main_~this_state~0 0))) (or (and .cse0 (= main_~q~0 2)) (and (= main_~q~0 3) (= main_~this_state~0 2)) (and .cse0 (= main_~q~0 0)) (and (= main_~this_state~0 3) (<= 4 main_~q~0)))) [2018-10-27 15:27:05,713 INFO L425 ceAbstractionStarter]: For program point L348(lines 348 363) no Hoare annotation was computed. [2018-10-27 15:27:05,713 INFO L425 ceAbstractionStarter]: For program point L216(lines 216 231) no Hoare annotation was computed. [2018-10-27 15:27:05,713 INFO L425 ceAbstractionStarter]: For program point L183(lines 183 282) no Hoare annotation was computed. [2018-10-27 15:27:05,713 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 161) no Hoare annotation was computed. [2018-10-27 15:27:05,713 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 347) no Hoare annotation was computed. [2018-10-27 15:27:05,713 INFO L425 ceAbstractionStarter]: For program point L266(lines 266 277) no Hoare annotation was computed. [2018-10-27 15:27:05,713 INFO L425 ceAbstractionStarter]: For program point L200(lines 200 215) no Hoare annotation was computed. [2018-10-27 15:27:05,713 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 145) no Hoare annotation was computed. [2018-10-27 15:27:05,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 03:27:05 BoogieIcfgContainer [2018-10-27 15:27:05,732 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 15:27:05,733 INFO L168 Benchmark]: Toolchain (without parser) took 4492.51 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 729.3 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -611.8 MB). Peak memory consumption was 117.4 MB. Max. memory is 7.1 GB. [2018-10-27 15:27:05,735 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 15:27:05,736 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-27 15:27:05,737 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 15:27:05,737 INFO L168 Benchmark]: Boogie Preprocessor took 51.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 15:27:05,738 INFO L168 Benchmark]: RCFGBuilder took 947.18 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 729.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -771.9 MB). Peak memory consumption was 18.0 MB. Max. memory is 7.1 GB. [2018-10-27 15:27:05,739 INFO L168 Benchmark]: TraceAbstraction took 3094.85 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 149.5 MB). Peak memory consumption was 149.5 MB. Max. memory is 7.1 GB. [2018-10-27 15:27:05,744 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 357.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 30.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 947.18 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 729.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -771.9 MB). Peak memory consumption was 18.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3094.85 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 149.5 MB). Peak memory consumption was 149.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 389]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((this_state <= 0 && q == 2) || (q == 3 && this_state == 2)) || (this_state <= 0 && q == 0)) || (this_state == 3 && 4 <= q) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (this_state <= 0 && q == 0) || (this_state == 3 && 4 <= q) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 83 locations, 1 error locations. SAFE Result, 3.0s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1008 SDtfs, 337 SDslu, 455 SDs, 0 SdLazy, 217 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 28 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 13 NumberOfFragments, 49 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 27 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 266 ConstructedInterpolants, 0 QuantifiedInterpolants, 10566 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 55/55 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...