java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:43:25,452 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:43:25,454 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:43:25,470 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:43:25,470 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:43:25,471 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:43:25,473 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:43:25,475 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:43:25,477 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:43:25,478 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:43:25,479 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:43:25,479 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:43:25,480 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:43:25,481 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:43:25,482 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:43:25,483 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:43:25,484 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:43:25,486 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:43:25,491 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:43:25,496 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:43:25,497 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:43:25,498 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:43:25,502 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:43:25,503 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:43:25,503 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:43:25,504 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:43:25,506 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:43:25,507 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:43:25,507 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:43:25,508 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:43:25,509 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:43:25,510 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:43:25,510 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:43:25,510 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:43:25,511 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:43:25,511 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:43:25,512 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:43:25,524 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:43:25,524 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:43:25,525 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:43:25,525 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:43:25,525 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:43:25,526 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:43:25,526 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:43:25,526 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:43:25,526 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:43:25,526 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:43:25,527 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:43:25,527 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:43:25,527 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:43:25,527 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:43:25,527 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:43:25,528 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:43:25,528 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:43:25,528 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:43:25,528 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:43:25,529 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:43:25,529 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:43:25,529 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:43:25,529 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:43:25,529 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:43:25,530 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:43:25,530 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:43:25,530 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:43:25,530 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:43:25,530 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:43:25,531 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:43:25,531 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:43:25,531 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:43:25,531 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:43:25,531 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:43:25,531 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:43:25,532 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:43:25,532 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:43:25,532 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:43:25,537 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:43:25,537 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:43:25,537 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:43:25,585 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:43:25,601 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:43:25,604 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:43:25,606 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:43:25,607 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:43:25,607 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl [2018-12-03 16:43:25,608 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl' [2018-12-03 16:43:25,675 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:43:25,678 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:43:25,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:43:25,679 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:43:25,679 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:43:25,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:25" (1/1) ... [2018-12-03 16:43:25,718 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:25" (1/1) ... [2018-12-03 16:43:25,734 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:43:25,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:43:25,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:43:25,736 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:43:25,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:25" (1/1) ... [2018-12-03 16:43:25,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:25" (1/1) ... [2018-12-03 16:43:25,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:25" (1/1) ... [2018-12-03 16:43:25,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:25" (1/1) ... [2018-12-03 16:43:25,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:25" (1/1) ... [2018-12-03 16:43:25,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:25" (1/1) ... [2018-12-03 16:43:25,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:25" (1/1) ... [2018-12-03 16:43:25,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:43:25,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:43:25,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:43:25,801 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:43:25,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-12-03 16:43:25,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:43:25,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:43:26,547 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:43:26,547 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:43:26,548 INFO L202 PluginConnector]: Adding new model pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:43:26 BoogieIcfgContainer [2018-12-03 16:43:26,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:43:26,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:43:26,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:43:26,554 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:43:26,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:25" (1/2) ... [2018-12-03 16:43:26,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f5803ef and model type pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:43:26, skipping insertion in model container [2018-12-03 16:43:26,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:43:26" (2/2) ... [2018-12-03 16:43:26,558 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl [2018-12-03 16:43:26,568 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:43:26,579 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:43:26,599 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:43:26,643 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:43:26,643 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:43:26,643 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:43:26,643 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:43:26,643 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:43:26,644 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:43:26,644 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:43:26,644 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:43:26,666 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-12-03 16:43:26,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:43:26,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:26,677 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:43:26,685 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:26,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:26,692 INFO L82 PathProgramCache]: Analyzing trace with hash -61215035, now seen corresponding path program 1 times [2018-12-03 16:43:26,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:26,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:26,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:26,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:26,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:26,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:26,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:43:26,946 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:26,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:26,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:26,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:26,967 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-12-03 16:43:27,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:27,032 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2018-12-03 16:43:27,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:27,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 16:43:27,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:27,046 INFO L225 Difference]: With dead ends: 54 [2018-12-03 16:43:27,046 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:43:27,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-03 16:43:27,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:43:27,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-12-03 16:43:27,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 16:43:27,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2018-12-03 16:43:27,097 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 17 [2018-12-03 16:43:27,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:27,097 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2018-12-03 16:43:27,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:27,098 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2018-12-03 16:43:27,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:43:27,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:27,099 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:43:27,099 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:27,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:27,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1341078713, now seen corresponding path program 1 times [2018-12-03 16:43:27,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:27,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:27,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:27,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:27,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:27,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:27,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:27,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:43:27,258 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:27,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:27,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:27,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:27,264 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 3 states. [2018-12-03 16:43:27,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:27,343 INFO L93 Difference]: Finished difference Result 97 states and 139 transitions. [2018-12-03 16:43:27,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:27,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 16:43:27,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:27,347 INFO L225 Difference]: With dead ends: 97 [2018-12-03 16:43:27,348 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 16:43:27,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-03 16:43:27,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 16:43:27,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-12-03 16:43:27,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 16:43:27,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2018-12-03 16:43:27,384 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 17 [2018-12-03 16:43:27,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:27,384 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2018-12-03 16:43:27,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:27,385 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2018-12-03 16:43:27,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:43:27,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:27,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:43:27,386 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:27,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:27,387 INFO L82 PathProgramCache]: Analyzing trace with hash -754272699, now seen corresponding path program 1 times [2018-12-03 16:43:27,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:27,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:27,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:27,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:27,390 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:27,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:27,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:27,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:43:27,524 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:27,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:27,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:27,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:27,526 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand 3 states. [2018-12-03 16:43:27,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:27,614 INFO L93 Difference]: Finished difference Result 187 states and 268 transitions. [2018-12-03 16:43:27,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:27,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 16:43:27,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:27,621 INFO L225 Difference]: With dead ends: 187 [2018-12-03 16:43:27,621 INFO L226 Difference]: Without dead ends: 125 [2018-12-03 16:43:27,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-03 16:43:27,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-03 16:43:27,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-12-03 16:43:27,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-03 16:43:27,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2018-12-03 16:43:27,683 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 17 [2018-12-03 16:43:27,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:27,684 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2018-12-03 16:43:27,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:27,684 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2018-12-03 16:43:27,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:43:27,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:27,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:43:27,686 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:27,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:27,686 INFO L82 PathProgramCache]: Analyzing trace with hash -53208121, now seen corresponding path program 1 times [2018-12-03 16:43:27,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:27,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:27,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:27,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:27,689 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:27,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:27,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:27,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:43:27,792 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:27,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:27,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:27,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:27,794 INFO L87 Difference]: Start difference. First operand 123 states and 174 transitions. Second operand 3 states. [2018-12-03 16:43:27,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:27,871 INFO L93 Difference]: Finished difference Result 367 states and 520 transitions. [2018-12-03 16:43:27,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:27,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 16:43:27,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:27,874 INFO L225 Difference]: With dead ends: 367 [2018-12-03 16:43:27,875 INFO L226 Difference]: Without dead ends: 245 [2018-12-03 16:43:27,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-03 16:43:27,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-12-03 16:43:27,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-12-03 16:43:27,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-12-03 16:43:27,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 338 transitions. [2018-12-03 16:43:27,933 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 338 transitions. Word has length 17 [2018-12-03 16:43:27,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:27,936 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 338 transitions. [2018-12-03 16:43:27,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:27,936 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 338 transitions. [2018-12-03 16:43:27,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:43:27,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:27,937 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:43:27,937 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:27,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:27,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1721799241, now seen corresponding path program 1 times [2018-12-03 16:43:27,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:27,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:27,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:27,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:27,942 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:28,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:28,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:28,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:43:28,150 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:28,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:43:28,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:43:28,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:43:28,151 INFO L87 Difference]: Start difference. First operand 243 states and 338 transitions. Second operand 4 states. [2018-12-03 16:43:28,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:28,415 INFO L93 Difference]: Finished difference Result 517 states and 707 transitions. [2018-12-03 16:43:28,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:43:28,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-03 16:43:28,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:28,419 INFO L225 Difference]: With dead ends: 517 [2018-12-03 16:43:28,419 INFO L226 Difference]: Without dead ends: 515 [2018-12-03 16:43:28,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:43:28,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-12-03 16:43:28,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 275. [2018-12-03 16:43:28,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-12-03 16:43:28,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 370 transitions. [2018-12-03 16:43:28,482 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 370 transitions. Word has length 17 [2018-12-03 16:43:28,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:28,483 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 370 transitions. [2018-12-03 16:43:28,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:43:28,483 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 370 transitions. [2018-12-03 16:43:28,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:43:28,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:28,484 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:43:28,485 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:28,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:28,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1721858823, now seen corresponding path program 1 times [2018-12-03 16:43:28,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:28,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:28,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:28,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:28,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:28,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:28,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:28,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:43:28,751 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:28,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:43:28,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:43:28,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:43:28,752 INFO L87 Difference]: Start difference. First operand 275 states and 370 transitions. Second operand 4 states. [2018-12-03 16:43:29,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:29,075 INFO L93 Difference]: Finished difference Result 799 states and 1085 transitions. [2018-12-03 16:43:29,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:43:29,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-03 16:43:29,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:29,079 INFO L225 Difference]: With dead ends: 799 [2018-12-03 16:43:29,079 INFO L226 Difference]: Without dead ends: 525 [2018-12-03 16:43:29,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:43:29,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-12-03 16:43:29,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 403. [2018-12-03 16:43:29,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-12-03 16:43:29,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 526 transitions. [2018-12-03 16:43:29,158 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 526 transitions. Word has length 17 [2018-12-03 16:43:29,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:29,158 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 526 transitions. [2018-12-03 16:43:29,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:43:29,159 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 526 transitions. [2018-12-03 16:43:29,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 16:43:29,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:29,162 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:43:29,162 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:29,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:29,162 INFO L82 PathProgramCache]: Analyzing trace with hash 2097839419, now seen corresponding path program 1 times [2018-12-03 16:43:29,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:29,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:29,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:29,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:29,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:29,490 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 16:43:29,494 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:29,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:29,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:43:29,495 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:29,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:29,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:29,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:29,496 INFO L87 Difference]: Start difference. First operand 403 states and 526 transitions. Second operand 3 states. [2018-12-03 16:43:29,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:29,711 INFO L93 Difference]: Finished difference Result 1207 states and 1576 transitions. [2018-12-03 16:43:29,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:29,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-03 16:43:29,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:29,728 INFO L225 Difference]: With dead ends: 1207 [2018-12-03 16:43:29,728 INFO L226 Difference]: Without dead ends: 805 [2018-12-03 16:43:29,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:29,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2018-12-03 16:43:29,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 803. [2018-12-03 16:43:29,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2018-12-03 16:43:29,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1026 transitions. [2018-12-03 16:43:29,909 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1026 transitions. Word has length 32 [2018-12-03 16:43:29,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:29,909 INFO L480 AbstractCegarLoop]: Abstraction has 803 states and 1026 transitions. [2018-12-03 16:43:29,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:29,911 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1026 transitions. [2018-12-03 16:43:29,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 16:43:29,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:29,917 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:43:29,921 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:29,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:29,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1417781049, now seen corresponding path program 1 times [2018-12-03 16:43:29,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:29,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:29,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:29,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:29,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:30,342 WARN L180 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2018-12-03 16:43:30,417 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:30,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:30,418 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:43:30,419 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-12-03 16:43:30,421 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [52], [54], [56], [60], [62], [64] [2018-12-03 16:43:30,467 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:43:30,468 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:43:31,916 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:43:31,919 INFO L272 AbstractInterpreter]: Visited 25 different actions 141 times. Merged at 23 different actions 81 times. Never widened. Found 34 fixpoints after 13 different actions. Largest state had 0 variables. [2018-12-03 16:43:31,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:31,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:43:31,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:31,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:43:31,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:31,985 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:43:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:32,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:43:32,518 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-12-03 16:43:32,803 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:32,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:43:33,271 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-03 16:43:33,277 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:33,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:43:33,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2018-12-03 16:43:33,310 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:43:33,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:43:33,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:43:33,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:43:33,311 INFO L87 Difference]: Start difference. First operand 803 states and 1026 transitions. Second operand 8 states. [2018-12-03 16:43:33,563 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-12-03 16:43:33,891 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2018-12-03 16:43:34,349 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2018-12-03 16:43:35,155 WARN L180 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2018-12-03 16:43:35,445 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2018-12-03 16:43:35,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:35,997 INFO L93 Difference]: Finished difference Result 1347 states and 1711 transitions. [2018-12-03 16:43:35,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:43:35,998 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-12-03 16:43:35,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:36,001 INFO L225 Difference]: With dead ends: 1347 [2018-12-03 16:43:36,001 INFO L226 Difference]: Without dead ends: 374 [2018-12-03 16:43:36,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:43:36,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-12-03 16:43:36,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 212. [2018-12-03 16:43:36,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-12-03 16:43:36,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 260 transitions. [2018-12-03 16:43:36,081 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 260 transitions. Word has length 32 [2018-12-03 16:43:36,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:36,081 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 260 transitions. [2018-12-03 16:43:36,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:43:36,082 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 260 transitions. [2018-12-03 16:43:36,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 16:43:36,084 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:36,084 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:43:36,085 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:36,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:36,085 INFO L82 PathProgramCache]: Analyzing trace with hash -2063114371, now seen corresponding path program 2 times [2018-12-03 16:43:36,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:36,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:36,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:36,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:36,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:36,167 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 16:43:36,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:36,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:43:36,168 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:36,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:36,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:36,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:36,169 INFO L87 Difference]: Start difference. First operand 212 states and 260 transitions. Second operand 3 states. [2018-12-03 16:43:36,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:36,181 INFO L93 Difference]: Finished difference Result 220 states and 268 transitions. [2018-12-03 16:43:36,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:36,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-03 16:43:36,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:36,182 INFO L225 Difference]: With dead ends: 220 [2018-12-03 16:43:36,182 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:43:36,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-03 16:43:36,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:43:36,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:43:36,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:43:36,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:43:36,184 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-12-03 16:43:36,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:36,184 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:43:36,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:36,185 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:43:36,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:43:36,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:43:36,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:36,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:36,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:36,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:36,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:36,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:36,959 WARN L180 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-12-03 16:43:37,486 WARN L180 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-12-03 16:43:37,796 WARN L180 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2018-12-03 16:43:38,116 WARN L180 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2018-12-03 16:43:38,367 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-12-03 16:43:38,578 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2018-12-03 16:43:38,808 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-12-03 16:43:38,912 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2018-12-03 16:43:39,150 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2018-12-03 16:43:39,303 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-12-03 16:43:39,436 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2018-12-03 16:43:39,654 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-12-03 16:43:39,948 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2018-12-03 16:43:39,952 INFO L444 ceAbstractionStarter]: At program point L403(lines 403 409) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (<= ~send3 127) (<= 1 ~mode4) (<= 0 ~send4) (<= ~send4 127) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= .cse0 ~p4_old) (<= 0 v_prenex_1)))) (= 0 (+ ~nomsg 1)) (<= ~r1 4) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-12-03 16:43:39,952 INFO L444 ceAbstractionStarter]: At program point L370(lines 370 380) the Hoare annotation is: (let ((.cse0 (<= (div ~mode4 256) 0)) (.cse2 (<= ~send3 127)) (.cse3 (<= 1 ~mode4)) (.cse4 (exists ((v_prenex_1 Int)) (let ((.cse10 (mod v_prenex_1 256))) (and (= ~p4_new .cse10) (<= .cse10 127) (<= v_prenex_1 127) (<= 0 v_prenex_1))))) (.cse5 (<= 0 ~send4)) (.cse6 (<= ~send4 127)) (.cse7 (not (= ~p3_new ~nomsg))) (.cse8 (= 0 (+ ~nomsg 1))) (.cse1 (<= ~r1 4)) (.cse9 (<= 0 ~send3))) (or (and .cse0 (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse1 .cse9 (not (= ~p3_old ~nomsg))))) [2018-12-03 16:43:39,952 INFO L444 ceAbstractionStarter]: At program point L304(lines 304 315) the Hoare annotation is: (let ((.cse1 (<= ~send3 127)) (.cse2 (<= 0 ~send4)) (.cse3 (<= ~send4 127)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3)) (.cse0 (div ~mode4 256))) (or (and (<= .cse0 0) .cse1 (<= 1 ~mode4) .cse2 .cse3 (exists ((v_prenex_1 Int)) (let ((.cse4 (mod v_prenex_1 256))) (and (<= .cse4 127) (<= v_prenex_1 127) (= .cse4 ~p4_old) (<= 0 v_prenex_1)))) .cse5 .cse6 (not (= ~p3_old ~nomsg))) (and (and .cse1 .cse2 .cse3 (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode2 (* 256 (div ~mode2 256))) (<= ~r1 4)) .cse5 .cse6) (= ~mode4 (* 256 .cse0))))) [2018-12-03 16:43:39,953 INFO L444 ceAbstractionStarter]: At program point L387(lines 379 388) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (<= ~send3 127) (<= 1 ~mode4) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (= ~p4_new .cse0) (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= 0 ~send4) (<= ~send4 127) (not (= ~p3_new ~nomsg)) (= 0 (+ ~nomsg 1)) (<= ~r1 4) (<= 0 ~send3)) [2018-12-03 16:43:39,953 INFO L444 ceAbstractionStarter]: At program point L321(lines 314 322) the Hoare annotation is: (let ((.cse1 (<= ~send3 127)) (.cse2 (<= 0 ~send4)) (.cse3 (<= ~send4 127)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3)) (.cse0 (div ~mode4 256))) (or (and (<= .cse0 0) .cse1 (<= 1 ~mode4) .cse2 .cse3 (exists ((v_prenex_1 Int)) (let ((.cse4 (mod v_prenex_1 256))) (and (<= .cse4 127) (<= v_prenex_1 127) (= .cse4 ~p4_old) (<= 0 v_prenex_1)))) .cse5 .cse6 (not (= ~p3_old ~nomsg))) (and (and .cse1 .cse2 .cse3 (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (<= ~r1 4)) .cse5 .cse6) (= ~mode4 (* 256 .cse0))))) [2018-12-03 16:43:39,953 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 81 448) no Hoare annotation was computed. [2018-12-03 16:43:39,953 INFO L444 ceAbstractionStarter]: At program point L445(lines 274 445) the Hoare annotation is: (let ((.cse5 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (<= 0 ~send4)) (.cse2 (<= ~send4 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3))) (or (and (and .cse0 .cse1 .cse2 .cse3 (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) (<= ~r1 4)) .cse4) (= ~mode4 (* 256 .cse5))) (and (<= .cse5 0) .cse0 (<= 1 ~mode4) .cse1 .cse2 (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 256))) (and (<= .cse6 127) (<= v_prenex_1 127) (= .cse6 ~p4_old) (<= 0 v_prenex_1)))) .cse3 .cse4 (not (= ~p3_old ~nomsg))))) [2018-12-03 16:43:39,953 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 81 448) no Hoare annotation was computed. [2018-12-03 16:43:39,954 INFO L444 ceAbstractionStarter]: At program point L412(lines 408 419) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (<= ~send3 127) (<= 1 ~mode4) (<= 0 ~send4) (<= ~send4 127) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= .cse0 ~p4_old) (<= 0 v_prenex_1)))) (= 0 (+ ~nomsg 1)) (<= ~r1 4) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-12-03 16:43:39,954 INFO L444 ceAbstractionStarter]: At program point L433(lines 433 440) the Hoare annotation is: (and (<= ~send3 127) (<= 1 ~mode4) (<= 0 ~send4) (<= (div ULTIMATE.start_assert_~arg 256) 0) (= 0 (+ ~nomsg 1)) (<= ~r1 4) (<= 0 ~send3) (not (= ~p3_old ~nomsg)) (<= (div ~mode4 256) 0) (<= ~send4 127) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= .cse0 ~p4_old) (<= 0 v_prenex_1)))) (<= 1 ULTIMATE.start_assert_~arg) (<= 1 ULTIMATE.start_check_~tmp~106)) [2018-12-03 16:43:39,954 INFO L444 ceAbstractionStarter]: At program point L326(lines 326 336) the Hoare annotation is: (let ((.cse1 (<= ~send3 127)) (.cse2 (<= 0 ~send4)) (.cse3 (<= ~send4 127)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3)) (.cse0 (div ~mode4 256))) (or (and (<= .cse0 0) .cse1 (<= 1 ~mode4) .cse2 .cse3 (exists ((v_prenex_1 Int)) (let ((.cse4 (mod v_prenex_1 256))) (and (<= .cse4 127) (<= v_prenex_1 127) (= .cse4 ~p4_old) (<= 0 v_prenex_1)))) .cse5 .cse6 (not (= ~p3_old ~nomsg))) (and (and .cse1 .cse2 .cse3 (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (<= ~r1 4)) .cse5 .cse6) (= ~mode4 (* 256 .cse0))))) [2018-12-03 16:43:39,954 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 81 448) no Hoare annotation was computed. [2018-12-03 16:43:39,955 INFO L444 ceAbstractionStarter]: At program point L281(lines 281 292) the Hoare annotation is: (let ((.cse5 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (<= 0 ~send4)) (.cse2 (<= ~send4 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3))) (or (and (and .cse0 .cse1 .cse2 .cse3 (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) (<= ~r1 4)) .cse4) (= ~mode4 (* 256 .cse5))) (and (<= .cse5 0) .cse0 (<= 1 ~mode4) .cse1 .cse2 (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 256))) (and (<= .cse6 127) (<= v_prenex_1 127) (= .cse6 ~p4_old) (<= 0 v_prenex_1)))) .cse3 .cse4 (not (= ~p3_old ~nomsg))))) [2018-12-03 16:43:39,955 INFO L444 ceAbstractionStarter]: At program point L343(lines 335 344) the Hoare annotation is: (let ((.cse11 (div ~mode4 256))) (let ((.cse0 (<= .cse11 0)) (.cse2 (<= 1 ~mode4)) (.cse5 (exists ((v_prenex_1 Int)) (let ((.cse12 (mod v_prenex_1 256))) (and (<= .cse12 127) (<= v_prenex_1 127) (= .cse12 ~p4_old) (<= 0 v_prenex_1))))) (.cse1 (<= ~send3 127)) (.cse3 (<= 0 ~send4)) (.cse4 (<= ~send4 127)) (.cse6 (not (= ~p3_new ~nomsg))) (.cse7 (= 0 (+ ~nomsg 1))) (.cse10 (<= ~r1 4)) (.cse8 (<= 0 ~send3)) (.cse9 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 (= ~mode3 (* 256 (div ~mode3 256))) .cse3 .cse4 .cse5 .cse7 .cse8 .cse9) (and (and (and (= ~mode5 (* 256 (div ~mode5 256))) .cse10) .cse1 .cse3 .cse4 .cse6 .cse7 .cse8) (= ~mode4 (* 256 .cse11))) (and .cse1 .cse3 .cse4 .cse6 .cse7 .cse10 .cse8 .cse9)))) [2018-12-03 16:43:39,955 INFO L444 ceAbstractionStarter]: At program point L348(lines 348 358) the Hoare annotation is: (let ((.cse11 (div ~mode4 256))) (let ((.cse0 (<= .cse11 0)) (.cse2 (<= 1 ~mode4)) (.cse5 (exists ((v_prenex_1 Int)) (let ((.cse12 (mod v_prenex_1 256))) (and (<= .cse12 127) (<= v_prenex_1 127) (= .cse12 ~p4_old) (<= 0 v_prenex_1))))) (.cse1 (<= ~send3 127)) (.cse3 (<= 0 ~send4)) (.cse4 (<= ~send4 127)) (.cse6 (not (= ~p3_new ~nomsg))) (.cse7 (= 0 (+ ~nomsg 1))) (.cse10 (<= ~r1 4)) (.cse8 (<= 0 ~send3)) (.cse9 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 (= ~mode3 (* 256 (div ~mode3 256))) .cse3 .cse4 .cse5 .cse7 .cse8 .cse9) (and (and (and (= ~mode5 (* 256 (div ~mode5 256))) .cse10) .cse1 .cse3 .cse4 .cse6 .cse7 .cse8) (= ~mode4 (* 256 .cse11))) (and .cse1 .cse3 .cse4 .cse6 .cse7 .cse10 .cse8 .cse9)))) [2018-12-03 16:43:39,955 INFO L444 ceAbstractionStarter]: At program point L439(lines 439 446) the Hoare annotation is: false [2018-12-03 16:43:39,955 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 447) no Hoare annotation was computed. [2018-12-03 16:43:39,956 INFO L444 ceAbstractionStarter]: At program point L365(lines 357 366) the Hoare annotation is: (let ((.cse0 (<= (div ~mode4 256) 0)) (.cse2 (<= ~send3 127)) (.cse3 (<= 1 ~mode4)) (.cse4 (exists ((v_prenex_1 Int)) (let ((.cse10 (mod v_prenex_1 256))) (and (= ~p4_new .cse10) (<= .cse10 127) (<= v_prenex_1 127) (<= 0 v_prenex_1))))) (.cse5 (<= 0 ~send4)) (.cse6 (<= ~send4 127)) (.cse7 (not (= ~p3_new ~nomsg))) (.cse8 (= 0 (+ ~nomsg 1))) (.cse1 (<= ~r1 4)) (.cse9 (<= 0 ~send3))) (or (and .cse0 (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse1 .cse9 (not (= ~p3_old ~nomsg))))) [2018-12-03 16:43:39,956 INFO L444 ceAbstractionStarter]: At program point L299(lines 291 300) the Hoare annotation is: (let ((.cse1 (<= ~send3 127)) (.cse2 (<= 0 ~send4)) (.cse3 (<= ~send4 127)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3)) (.cse0 (div ~mode4 256))) (or (and (<= .cse0 0) .cse1 (<= 1 ~mode4) .cse2 .cse3 (exists ((v_prenex_1 Int)) (let ((.cse4 (mod v_prenex_1 256))) (and (<= .cse4 127) (<= v_prenex_1 127) (= .cse4 ~p4_old) (<= 0 v_prenex_1)))) .cse5 .cse6 (not (= ~p3_old ~nomsg))) (and (and .cse1 .cse2 .cse3 (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode2 (* 256 (div ~mode2 256))) (<= ~r1 4)) .cse5 .cse6) (= ~mode4 (* 256 .cse0))))) [2018-12-03 16:43:39,956 INFO L444 ceAbstractionStarter]: At program point L423(lines 418 424) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (<= ~send3 127) (<= 1 ~mode4) (<= 0 ~send4) (<= ~send4 127) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= .cse0 ~p4_old) (<= 0 v_prenex_1)))) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_check_~tmp~106) (<= ~r1 4) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-12-03 16:43:39,981 INFO L202 PluginConnector]: Adding new model pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:43:39 BoogieIcfgContainer [2018-12-03 16:43:39,981 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:43:39,982 INFO L168 Benchmark]: Toolchain (without parser) took 14306.03 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 826.8 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -696.4 MB). Peak memory consumption was 614.0 MB. Max. memory is 7.1 GB. [2018-12-03 16:43:39,983 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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-12-03 16:43:39,984 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.34 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-12-03 16:43:39,984 INFO L168 Benchmark]: Boogie Preprocessor took 65.48 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-12-03 16:43:39,985 INFO L168 Benchmark]: RCFGBuilder took 746.75 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-12-03 16:43:39,986 INFO L168 Benchmark]: TraceAbstraction took 13432.54 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 826.8 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -738.7 MB). Peak memory consumption was 571.7 MB. Max. memory is 7.1 GB. [2018-12-03 16:43:39,989 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 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 Procedure Inliner took 56.34 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 65.48 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 746.75 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13432.54 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 826.8 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -738.7 MB). Peak memory consumption was 571.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 447]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_prenex_1 : int :: ((~p4_new == v_prenex_1 % 256 && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send4) && ~send4 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3 - InvariantResult [Line: 357]: Loop Invariant Derived loop invariant: (((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256) && ~r1 <= 4) && ~send3 <= 127) && 1 <= ~mode4) && (exists v_prenex_1 : int :: ((~p4_new == v_prenex_1 % 256 && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send4) && ~send4 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) || ((((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_prenex_1 : int :: ((~p4_new == v_prenex_1 % 256 && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send4) && ~send4 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: (((((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send4) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~r1 <= 4) && ~send3 <= 127) && 0 <= ~send4) && ~send4 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256))) || (((((((~send3 <= 127 && 0 <= ~send4) && ~send4 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 439]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send4) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 0 <= ~send4) && ~send4 <= 127) && (~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~r1 <= 4) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send4) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 291]: Loop Invariant Derived loop invariant: ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send4) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 0 <= ~send4) && ~send4 <= 127) && ((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~r1 <= 4) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 274]: Loop Invariant Derived loop invariant: ((((((~send3 <= 127 && 0 <= ~send4) && ~send4 <= 127) && 0 == ~nomsg + 1) && (((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~r1 <= 4) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256)) || ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send4) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 370]: Loop Invariant Derived loop invariant: (((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256) && ~r1 <= 4) && ~send3 <= 127) && 1 <= ~mode4) && (exists v_prenex_1 : int :: ((~p4_new == v_prenex_1 % 256 && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send4) && ~send4 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) || ((((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_prenex_1 : int :: ((~p4_new == v_prenex_1 % 256 && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send4) && ~send4 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: (((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send4) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~106) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 348]: Loop Invariant Derived loop invariant: (((((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send4) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~r1 <= 4) && ~send3 <= 127) && 0 <= ~send4) && ~send4 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256))) || (((((((~send3 <= 127 && 0 <= ~send4) && ~send4 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send4) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 433]: Loop Invariant Derived loop invariant: (((((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send4) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~mode4 / 256 <= 0) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 1 <= assert_~arg) && 1 <= check_~tmp~106 - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send4) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 0 <= ~send4) && ~send4 <= 127) && (~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~r1 <= 4) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 304]: Loop Invariant Derived loop invariant: ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send4) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 0 <= ~send4) && ~send4 <= 127) && ((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~r1 <= 4) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((((~send3 <= 127 && 0 <= ~send4) && ~send4 <= 127) && 0 == ~nomsg + 1) && (((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~r1 <= 4) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256)) || ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send4) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 13.3s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 3.9s AutomataDifference, 0.0s DeadEndRemovalTime, 3.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 287 SDtfs, 265 SDslu, 246 SDs, 0 SdLazy, 184 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=803occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.5s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 534 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 195 NumberOfFragments, 1458 HoareAnnotationTreeSize, 16 FomulaSimplifications, 16272 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 16 FomulaSimplificationsInter, 1376 FormulaSimplificationTreeSizeReductionInter, 3.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 251 ConstructedInterpolants, 17 QuantifiedInterpolants, 40742 SizeOfPredicates, 4 NumberOfNonLiveVariables, 307 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 47/75 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...