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.1.ufo.UNBOUNDED.pals.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:43:23,519 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:43:23,526 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:43:23,547 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:43:23,547 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:43:23,548 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:43:23,551 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:43:23,554 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:43:23,560 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:43:23,561 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:43:23,561 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:43:23,563 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:43:23,564 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:43:23,565 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:43:23,566 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:43:23,572 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:43:23,573 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:43:23,578 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:43:23,584 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:43:23,586 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:43:23,587 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:43:23,590 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:43:23,595 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:43:23,595 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:43:23,596 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:43:23,596 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:43:23,597 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:43:23,601 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:43:23,602 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:43:23,605 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:43:23,606 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:43:23,606 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:43:23,607 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:43:23,607 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:43:23,610 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:43:23,611 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:43:23,611 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:23,634 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:43:23,634 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:43:23,635 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:43:23,635 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:43:23,635 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:43:23,636 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:43:23,636 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:43:23,636 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:43:23,636 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:43:23,637 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:43:23,637 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:43:23,637 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:43:23,637 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:43:23,637 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:43:23,637 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:43:23,638 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:43:23,638 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:43:23,639 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:43:23,640 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:43:23,640 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:43:23,640 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:43:23,641 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:43:23,641 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:43:23,641 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:43:23,641 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:43:23,642 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:43:23,642 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:43:23,642 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:43:23,642 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:43:23,642 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:43:23,643 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:43:23,643 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:43:23,643 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:43:23,643 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:43:23,643 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:43:23,644 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:43:23,645 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:43:23,645 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:43:23,645 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:43:23,645 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:43:23,645 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:43:23,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:43:23,696 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:43:23,700 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:43:23,702 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:43:23,702 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:43:23,703 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl [2018-12-03 16:43:23,703 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl' [2018-12-03 16:43:23,771 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:43:23,773 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:43:23,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:43:23,774 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:43:23,774 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:43:23,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:23" (1/1) ... [2018-12-03 16:43:23,810 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:23" (1/1) ... [2018-12-03 16:43:23,830 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:43:23,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:43:23,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:43:23,831 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:43:23,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:23" (1/1) ... [2018-12-03 16:43:23,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:23" (1/1) ... [2018-12-03 16:43:23,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:23" (1/1) ... [2018-12-03 16:43:23,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:23" (1/1) ... [2018-12-03 16:43:23,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:23" (1/1) ... [2018-12-03 16:43:23,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:23" (1/1) ... [2018-12-03 16:43:23,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:23" (1/1) ... [2018-12-03 16:43:23,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:43:23,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:43:23,888 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:43:23,888 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:43:23,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:23" (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:23,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:43:23,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:43:24,558 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:43:24,559 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:43:24,559 INFO L202 PluginConnector]: Adding new model pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:43:24 BoogieIcfgContainer [2018-12-03 16:43:24,559 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:43:24,560 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:43:24,560 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:43:24,564 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:43:24,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:23" (1/2) ... [2018-12-03 16:43:24,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cda8373 and model type pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:43:24, skipping insertion in model container [2018-12-03 16:43:24,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:43:24" (2/2) ... [2018-12-03 16:43:24,567 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl [2018-12-03 16:43:24,577 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:43:24,585 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:43:24,600 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:43:24,632 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:43:24,632 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:43:24,632 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:43:24,633 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:43:24,633 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:43:24,633 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:43:24,633 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:43:24,633 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:43:24,648 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-12-03 16:43:24,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:43:24,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:24,656 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:24,659 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:24,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:24,665 INFO L82 PathProgramCache]: Analyzing trace with hash -61215035, now seen corresponding path program 1 times [2018-12-03 16:43:24,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:24,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:24,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:24,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:24,728 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:24,926 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:24,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:24,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:43:24,930 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:24,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:24,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:24,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:24,953 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-12-03 16:43:24,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:24,988 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2018-12-03 16:43:24,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:24,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 16:43:24,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:25,000 INFO L225 Difference]: With dead ends: 54 [2018-12-03 16:43:25,000 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:43:25,004 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:25,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:43:25,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-12-03 16:43:25,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 16:43:25,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2018-12-03 16:43:25,051 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 17 [2018-12-03 16:43:25,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:25,051 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2018-12-03 16:43:25,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:25,052 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2018-12-03 16:43:25,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:43:25,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:25,053 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:25,053 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:25,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:25,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1341078713, now seen corresponding path program 1 times [2018-12-03 16:43:25,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:25,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:25,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:25,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:25,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:25,163 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:25,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:25,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:43:25,163 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:25,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:25,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:25,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:25,166 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 3 states. [2018-12-03 16:43:25,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:25,224 INFO L93 Difference]: Finished difference Result 97 states and 139 transitions. [2018-12-03 16:43:25,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:25,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 16:43:25,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:25,227 INFO L225 Difference]: With dead ends: 97 [2018-12-03 16:43:25,227 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 16:43:25,228 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:25,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 16:43:25,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-12-03 16:43:25,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 16:43:25,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2018-12-03 16:43:25,249 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 17 [2018-12-03 16:43:25,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:25,249 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2018-12-03 16:43:25,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:25,249 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2018-12-03 16:43:25,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:43:25,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:25,250 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:25,251 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:25,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:25,251 INFO L82 PathProgramCache]: Analyzing trace with hash -754272699, now seen corresponding path program 1 times [2018-12-03 16:43:25,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:25,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:25,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:25,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:25,254 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:25,401 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:25,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:25,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:43:25,405 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:25,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:25,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:25,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:25,407 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand 3 states. [2018-12-03 16:43:25,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:25,477 INFO L93 Difference]: Finished difference Result 187 states and 268 transitions. [2018-12-03 16:43:25,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:25,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 16:43:25,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:25,482 INFO L225 Difference]: With dead ends: 187 [2018-12-03 16:43:25,482 INFO L226 Difference]: Without dead ends: 125 [2018-12-03 16:43:25,483 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:25,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-03 16:43:25,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-12-03 16:43:25,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-03 16:43:25,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2018-12-03 16:43:25,541 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 17 [2018-12-03 16:43:25,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:25,541 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2018-12-03 16:43:25,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:25,541 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2018-12-03 16:43:25,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:43:25,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:25,543 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:25,543 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:25,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:25,543 INFO L82 PathProgramCache]: Analyzing trace with hash -53208121, now seen corresponding path program 1 times [2018-12-03 16:43:25,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:25,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:25,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:25,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:25,549 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:25,654 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:25,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:25,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:43:25,655 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:25,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:25,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:25,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:25,657 INFO L87 Difference]: Start difference. First operand 123 states and 174 transitions. Second operand 3 states. [2018-12-03 16:43:25,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:25,729 INFO L93 Difference]: Finished difference Result 367 states and 520 transitions. [2018-12-03 16:43:25,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:25,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 16:43:25,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:25,733 INFO L225 Difference]: With dead ends: 367 [2018-12-03 16:43:25,733 INFO L226 Difference]: Without dead ends: 245 [2018-12-03 16:43:25,734 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:25,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-12-03 16:43:25,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-12-03 16:43:25,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-12-03 16:43:25,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 338 transitions. [2018-12-03 16:43:25,815 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 338 transitions. Word has length 17 [2018-12-03 16:43:25,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:25,815 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 338 transitions. [2018-12-03 16:43:25,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:25,816 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 338 transitions. [2018-12-03 16:43:25,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:43:25,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:25,817 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:25,817 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:25,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:25,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1721799241, now seen corresponding path program 1 times [2018-12-03 16:43:25,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:25,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:25,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:25,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:25,820 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:25,962 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:25,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:25,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:43:25,963 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:25,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:43:25,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:43:25,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:43:25,964 INFO L87 Difference]: Start difference. First operand 243 states and 338 transitions. Second operand 4 states. [2018-12-03 16:43:26,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:26,267 INFO L93 Difference]: Finished difference Result 517 states and 707 transitions. [2018-12-03 16:43:26,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:43:26,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-03 16:43:26,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:26,272 INFO L225 Difference]: With dead ends: 517 [2018-12-03 16:43:26,272 INFO L226 Difference]: Without dead ends: 515 [2018-12-03 16:43:26,274 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:26,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-12-03 16:43:26,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 275. [2018-12-03 16:43:26,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-12-03 16:43:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 370 transitions. [2018-12-03 16:43:26,354 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 370 transitions. Word has length 17 [2018-12-03 16:43:26,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:26,354 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 370 transitions. [2018-12-03 16:43:26,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:43:26,357 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 370 transitions. [2018-12-03 16:43:26,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:43:26,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:26,358 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,358 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:26,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:26,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1721858823, now seen corresponding path program 1 times [2018-12-03 16:43:26,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:26,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:26,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:26,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:26,362 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:26,495 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,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:26,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:43:26,496 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:26,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:43:26,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:43:26,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:43:26,497 INFO L87 Difference]: Start difference. First operand 275 states and 370 transitions. Second operand 4 states. [2018-12-03 16:43:26,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:26,824 INFO L93 Difference]: Finished difference Result 879 states and 1193 transitions. [2018-12-03 16:43:26,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:43:26,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-03 16:43:26,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:26,835 INFO L225 Difference]: With dead ends: 879 [2018-12-03 16:43:26,835 INFO L226 Difference]: Without dead ends: 605 [2018-12-03 16:43:26,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:43:26,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-12-03 16:43:26,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2018-12-03 16:43:26,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-12-03 16:43:26,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 776 transitions. [2018-12-03 16:43:26,949 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 776 transitions. Word has length 17 [2018-12-03 16:43:26,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:26,949 INFO L480 AbstractCegarLoop]: Abstraction has 605 states and 776 transitions. [2018-12-03 16:43:26,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:43:26,950 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 776 transitions. [2018-12-03 16:43:26,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 16:43:26,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:26,959 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 16:43:26,960 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:26,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:26,963 INFO L82 PathProgramCache]: Analyzing trace with hash 868944887, now seen corresponding path program 1 times [2018-12-03 16:43:26,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:26,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:26,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:26,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:26,968 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:27,166 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-03 16:43:27,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:27,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:43:27,167 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:27,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:27,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:27,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:27,168 INFO L87 Difference]: Start difference. First operand 605 states and 776 transitions. Second operand 3 states. [2018-12-03 16:43:27,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:27,447 INFO L93 Difference]: Finished difference Result 1809 states and 2322 transitions. [2018-12-03 16:43:27,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:27,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-12-03 16:43:27,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:27,456 INFO L225 Difference]: With dead ends: 1809 [2018-12-03 16:43:27,456 INFO L226 Difference]: Without dead ends: 1207 [2018-12-03 16:43:27,463 INFO L631 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-12-03 16:43:27,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2018-12-03 16:43:27,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1205. [2018-12-03 16:43:27,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-12-03 16:43:27,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1508 transitions. [2018-12-03 16:43:27,674 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1508 transitions. Word has length 62 [2018-12-03 16:43:27,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:27,674 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1508 transitions. [2018-12-03 16:43:27,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:27,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1508 transitions. [2018-12-03 16:43:27,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 16:43:27,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:27,680 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 16:43:27,680 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:27,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:27,680 INFO L82 PathProgramCache]: Analyzing trace with hash 2034253683, now seen corresponding path program 1 times [2018-12-03 16:43:27,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:27,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:27,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:27,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:27,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:28,227 WARN L180 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2018-12-03 16:43:28,670 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-12-03 16:43:28,685 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 53 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-03 16:43:28,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:28,685 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:43:28,687 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-12-03 16:43:28,690 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:28,749 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:43:28,749 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:43:30,231 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:43:30,233 INFO L272 AbstractInterpreter]: Visited 25 different actions 130 times. Merged at 23 different actions 73 times. Never widened. Found 28 fixpoints after 12 different actions. Largest state had 0 variables. [2018-12-03 16:43:30,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:30,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:43:30,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:30,268 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:30,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:30,284 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:43:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:30,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:43:30,978 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-12-03 16:43:31,232 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-03 16:43:31,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:43:32,007 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-03 16:43:32,016 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-03 16:43:32,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:43:32,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2018-12-03 16:43:32,047 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:43:32,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:43:32,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:43:32,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:43:32,049 INFO L87 Difference]: Start difference. First operand 1205 states and 1508 transitions. Second operand 8 states. [2018-12-03 16:43:33,152 WARN L180 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2018-12-03 16:43:33,534 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2018-12-03 16:43:34,903 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2018-12-03 16:43:35,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:35,481 INFO L93 Difference]: Finished difference Result 2024 states and 2520 transitions. [2018-12-03 16:43:35,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:43:35,482 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-12-03 16:43:35,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:35,485 INFO L225 Difference]: With dead ends: 2024 [2018-12-03 16:43:35,485 INFO L226 Difference]: Without dead ends: 565 [2018-12-03 16:43:35,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2018-12-03 16:43:35,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-12-03 16:43:35,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 378. [2018-12-03 16:43:35,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-12-03 16:43:35,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 442 transitions. [2018-12-03 16:43:35,598 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 442 transitions. Word has length 62 [2018-12-03 16:43:35,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:35,598 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 442 transitions. [2018-12-03 16:43:35,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:43:35,598 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 442 transitions. [2018-12-03 16:43:35,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 16:43:35,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:35,600 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 16:43:35,600 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:35,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:35,601 INFO L82 PathProgramCache]: Analyzing trace with hash -552343681, now seen corresponding path program 2 times [2018-12-03 16:43:35,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:35,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:35,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:35,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:35,603 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:35,698 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-12-03 16:43:35,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:35,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:43:35,699 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:35,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:35,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:35,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:35,701 INFO L87 Difference]: Start difference. First operand 378 states and 442 transitions. Second operand 3 states. [2018-12-03 16:43:35,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:35,718 INFO L93 Difference]: Finished difference Result 384 states and 448 transitions. [2018-12-03 16:43:35,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:35,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-12-03 16:43:35,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:35,719 INFO L225 Difference]: With dead ends: 384 [2018-12-03 16:43:35,719 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:43:35,720 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:35,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:43:35,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:43:35,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:43:35,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:43:35,723 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2018-12-03 16:43:35,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:35,724 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:43:35,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:35,724 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:43:35,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:43:35,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:43:35,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:35,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:35,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:35,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:35,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:35,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:35,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:35,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:35,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:35,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:35,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:35,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:36,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:36,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:36,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:36,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:36,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:36,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:36,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:36,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:36,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:36,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:36,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:36,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:37,137 WARN L180 SmtUtils]: Spent 984.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-12-03 16:43:38,114 WARN L180 SmtUtils]: Spent 974.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-03 16:43:40,010 WARN L180 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-12-03 16:43:40,488 WARN L180 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2018-12-03 16:43:41,594 WARN L180 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-12-03 16:43:41,937 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-12-03 16:43:42,043 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-03 16:43:42,264 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2018-12-03 16:43:42,529 WARN L180 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2018-12-03 16:43:43,066 WARN L180 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-12-03 16:43:43,241 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-12-03 16:43:43,468 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2018-12-03 16:43:43,570 INFO L444 ceAbstractionStarter]: At program point L320(lines 313 321) the Hoare annotation is: (let ((.cse4 (div ~mode4 256))) (let ((.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse7 (<= .cse4 0)) (.cse1 (<= ~send3 127)) (.cse8 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse9 (not (= ~p3_old ~nomsg))) (.cse6 (<= ~send5 127))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 .cse3 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 .cse4)) .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse9 .cse6) (and .cse7 .cse1 .cse8 .cse2 (exists ((v_prenex_1 Int)) (let ((.cse10 (mod v_prenex_1 256))) (and (= .cse10 ~p5_old) (<= .cse10 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse3 .cse5 .cse9 .cse6)))) [2018-12-03 16:43:43,570 INFO L444 ceAbstractionStarter]: At program point L411(lines 407 418) the Hoare annotation is: (let ((.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse3 (<= 0 ~send5)) (.cse4 (<= ~r1 (+ (* 256 (div ~r1 256)) 4))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3)) (.cse7 (not (= ~p3_old ~nomsg))) (.cse8 (<= ~send5 127))) (or (and .cse0 (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (= .cse9 ~p5_old) (<= .cse9 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse5 .cse6 .cse7 .cse8))) [2018-12-03 16:43:43,570 INFO L444 ceAbstractionStarter]: At program point L279(lines 279 291) the Hoare annotation is: (let ((.cse4 (div ~mode4 256))) (let ((.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse7 (<= .cse4 0)) (.cse1 (<= ~send3 127)) (.cse8 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse9 (not (= ~p3_old ~nomsg))) (.cse6 (<= ~send5 127))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse3 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 .cse4)) .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse9 .cse6) (and .cse7 .cse1 .cse8 .cse2 (exists ((v_prenex_1 Int)) (let ((.cse10 (mod v_prenex_1 256))) (and (= .cse10 ~p5_old) (<= .cse10 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse3 .cse5 .cse9 .cse6)))) [2018-12-03 16:43:43,570 INFO L444 ceAbstractionStarter]: At program point L432(lines 432 439) the Hoare annotation is: (let ((.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse3 (= ULTIMATE.start_assert_~arg 1)) (.cse4 (<= 0 ~send5)) (.cse5 (<= ~r1 (+ (* 256 (div ~r1 256)) 4))) (.cse6 (<= 1 ULTIMATE.start_check_~tmp~108)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= 0 ~send3)) (.cse9 (not (= ~p3_old ~nomsg))) (.cse10 (<= ~send5 127))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod v_prenex_1 256))) (and (= .cse11 ~p5_old) (<= .cse11 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse7 .cse8 .cse9 .cse10))) [2018-12-03 16:43:43,571 INFO L444 ceAbstractionStarter]: At program point L325(lines 325 335) the Hoare annotation is: (let ((.cse4 (div ~mode4 256))) (let ((.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse7 (<= .cse4 0)) (.cse1 (<= ~send3 127)) (.cse8 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse9 (not (= ~p3_old ~nomsg))) (.cse6 (<= ~send5 127))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 .cse3 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 .cse4)) .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse9 .cse6) (and .cse7 .cse1 .cse8 .cse2 (exists ((v_prenex_1 Int)) (let ((.cse10 (mod v_prenex_1 256))) (and (= .cse10 ~p5_old) (<= .cse10 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse3 .cse5 .cse9 .cse6)))) [2018-12-03 16:43:43,571 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 81 444) no Hoare annotation was computed. [2018-12-03 16:43:43,571 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 81 444) no Hoare annotation was computed. [2018-12-03 16:43:43,571 INFO L444 ceAbstractionStarter]: At program point L441(lines 272 441) the Hoare annotation is: (let ((.cse4 (div ~mode4 256))) (let ((.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse7 (<= .cse4 0)) (.cse1 (<= ~send3 127)) (.cse8 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse9 (not (= ~p3_old ~nomsg))) (.cse6 (<= ~send5 127))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse3 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 .cse4)) .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse9 .cse6) (and .cse7 .cse1 .cse8 .cse2 (exists ((v_prenex_1 Int)) (let ((.cse10 (mod v_prenex_1 256))) (and (= .cse10 ~p5_old) (<= .cse10 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse3 .cse5 .cse9 .cse6)))) [2018-12-03 16:43:43,572 INFO L444 ceAbstractionStarter]: At program point L342(lines 334 343) the Hoare annotation is: (let ((.cse13 (div ~mode4 256)) (.cse12 (* 256 (div ~r1 256)))) (let ((.cse3 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse14 (<= ~r1 (+ .cse12 4))) (.cse5 (exists ((v_prenex_1 Int)) (let ((.cse15 (mod v_prenex_1 256))) (and (= .cse15 ~p5_old) (<= .cse15 127) (<= v_prenex_1 127) (<= 0 v_prenex_1))))) (.cse0 (<= .cse13 0)) (.cse10 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse4 (<= 0 ~send5)) (.cse11 (not (= ~p3_new ~nomsg))) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= 0 ~send3)) (.cse8 (not (= ~p3_old ~nomsg))) (.cse9 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse4 .cse11 .cse6 (<= ~r1 .cse12) (= ~mode4 (* 256 .cse13)) .cse7 .cse9) (and .cse0 .cse10 .cse3 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse4 .cse14 .cse11 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse4 .cse14 .cse5 .cse11 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse4 .cse11 .cse6 .cse7 .cse8 .cse9)))) [2018-12-03 16:43:43,572 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 81 444) no Hoare annotation was computed. [2018-12-03 16:43:43,572 INFO L444 ceAbstractionStarter]: At program point L347(lines 347 357) the Hoare annotation is: (let ((.cse13 (div ~mode4 256)) (.cse12 (* 256 (div ~r1 256)))) (let ((.cse3 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse14 (<= ~r1 (+ .cse12 4))) (.cse5 (exists ((v_prenex_1 Int)) (let ((.cse15 (mod v_prenex_1 256))) (and (= .cse15 ~p5_old) (<= .cse15 127) (<= v_prenex_1 127) (<= 0 v_prenex_1))))) (.cse0 (<= .cse13 0)) (.cse10 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse4 (<= 0 ~send5)) (.cse11 (not (= ~p3_new ~nomsg))) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= 0 ~send3)) (.cse8 (not (= ~p3_old ~nomsg))) (.cse9 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse4 .cse11 .cse6 (<= ~r1 .cse12) (= ~mode4 (* 256 .cse13)) .cse7 .cse9) (and .cse0 .cse10 .cse3 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse4 .cse14 .cse11 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse4 .cse14 .cse5 .cse11 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse4 .cse11 .cse6 .cse7 .cse8 .cse9)))) [2018-12-03 16:43:43,572 INFO L444 ceAbstractionStarter]: At program point L438(lines 438 442) the Hoare annotation is: false [2018-12-03 16:43:43,572 INFO L444 ceAbstractionStarter]: At program point L364(lines 356 365) the Hoare annotation is: (let ((.cse12 (* 256 (div ~r1 256)))) (let ((.cse5 (<= ~r1 (+ .cse12 4))) (.cse9 (not (= ~p3_old ~nomsg))) (.cse0 (<= (div ~mode4 256) 0)) (.cse1 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse2 (<= ~send3 127)) (.cse3 (<= 1 ~mode4)) (.cse4 (<= 0 ~send5)) (.cse6 (not (= ~p3_new ~nomsg))) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= 0 ~send3)) (.cse10 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse3 .cse4 .cse5 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod v_prenex_1 256))) (and (= .cse11 ~p5_old) (<= .cse11 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (<= ~r1 .cse12) .cse8 .cse10)))) [2018-12-03 16:43:43,573 INFO L444 ceAbstractionStarter]: At program point L298(lines 290 299) the Hoare annotation is: (let ((.cse4 (div ~mode4 256))) (let ((.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse7 (<= .cse4 0)) (.cse1 (<= ~send3 127)) (.cse8 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse9 (not (= ~p3_old ~nomsg))) (.cse6 (<= ~send5 127))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 (= ~mode2 (* 256 (div ~mode2 256))) .cse3 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 .cse4)) .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse9 .cse6) (and .cse7 .cse1 .cse8 .cse2 (exists ((v_prenex_1 Int)) (let ((.cse10 (mod v_prenex_1 256))) (and (= .cse10 ~p5_old) (<= .cse10 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse3 .cse5 .cse9 .cse6)))) [2018-12-03 16:43:43,573 INFO L444 ceAbstractionStarter]: At program point L422(lines 417 423) the Hoare annotation is: (let ((.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse3 (<= 0 ~send5)) (.cse4 (<= ~r1 (+ (* 256 (div ~r1 256)) 4))) (.cse5 (<= 1 ULTIMATE.start_check_~tmp~108)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= 0 ~send3)) (.cse9 (not (= ~p3_old ~nomsg))) (.cse10 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 256))) (and (= .cse6 ~p5_old) (<= .cse6 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse7 .cse8 .cse9 .cse10) (and .cse0 (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10))) [2018-12-03 16:43:43,573 INFO L444 ceAbstractionStarter]: At program point L402(lines 402 408) the Hoare annotation is: (let ((.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse3 (<= 0 ~send5)) (.cse4 (<= ~r1 (+ (* 256 (div ~r1 256)) 4))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3)) (.cse7 (not (= ~p3_old ~nomsg))) (.cse8 (<= ~send5 127))) (or (and .cse0 (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (= .cse9 ~p5_old) (<= .cse9 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse5 .cse6 .cse7 .cse8))) [2018-12-03 16:43:43,573 INFO L444 ceAbstractionStarter]: At program point L369(lines 369 379) the Hoare annotation is: (let ((.cse12 (* 256 (div ~r1 256)))) (let ((.cse5 (<= ~r1 (+ .cse12 4))) (.cse9 (not (= ~p3_old ~nomsg))) (.cse0 (<= (div ~mode4 256) 0)) (.cse1 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse2 (<= ~send3 127)) (.cse3 (<= 1 ~mode4)) (.cse4 (<= 0 ~send5)) (.cse6 (not (= ~p3_new ~nomsg))) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= 0 ~send3)) (.cse10 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse3 .cse4 .cse5 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod v_prenex_1 256))) (and (= .cse11 ~p5_old) (<= .cse11 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (<= ~r1 .cse12) .cse8 .cse10)))) [2018-12-03 16:43:43,573 INFO L444 ceAbstractionStarter]: At program point L303(lines 303 314) the Hoare annotation is: (let ((.cse4 (div ~mode4 256))) (let ((.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse7 (<= .cse4 0)) (.cse1 (<= ~send3 127)) (.cse8 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse9 (not (= ~p3_old ~nomsg))) (.cse6 (<= ~send5 127))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 (= ~mode2 (* 256 (div ~mode2 256))) .cse3 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 .cse4)) .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse9 .cse6) (and .cse7 .cse1 .cse8 .cse2 (exists ((v_prenex_1 Int)) (let ((.cse10 (mod v_prenex_1 256))) (and (= .cse10 ~p5_old) (<= .cse10 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse3 .cse5 .cse9 .cse6)))) [2018-12-03 16:43:43,574 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 443) no Hoare annotation was computed. [2018-12-03 16:43:43,574 INFO L444 ceAbstractionStarter]: At program point L386(lines 378 387) the Hoare annotation is: (let ((.cse12 (* 256 (div ~r1 256)))) (let ((.cse4 (<= ~r1 (+ .cse12 4))) (.cse9 (not (= ~p3_old ~nomsg))) (.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse3 (<= 0 ~send5)) (.cse5 (not (= ~p3_new ~nomsg))) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (exists ((v_prenex_1 Int)) (let ((.cse13 (mod v_prenex_1 256))) (and (= ~p5_new .cse13) (<= .cse13 127) (<= v_prenex_1 127) (<= 0 v_prenex_1))))) (.cse8 (<= 0 ~send3)) (.cse10 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod v_prenex_1 256))) (and (= .cse11 ~p5_old) (<= .cse11 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse5 .cse6 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 (<= ~r1 .cse12) .cse7 .cse8 .cse10)))) [2018-12-03 16:43:43,603 INFO L202 PluginConnector]: Adding new model pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:43:43 BoogieIcfgContainer [2018-12-03 16:43:43,603 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:43:43,604 INFO L168 Benchmark]: Toolchain (without parser) took 19832.60 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 842.0 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -604.2 MB). Peak memory consumption was 619.5 MB. Max. memory is 7.1 GB. [2018-12-03 16:43:43,605 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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:43,606 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.12 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:43,606 INFO L168 Benchmark]: Boogie Preprocessor took 56.68 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:43,607 INFO L168 Benchmark]: RCFGBuilder took 671.41 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 16:43:43,608 INFO L168 Benchmark]: TraceAbstraction took 19043.07 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 842.0 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -635.9 MB). Peak memory consumption was 587.8 MB. Max. memory is 7.1 GB. [2018-12-03 16:43:43,612 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.19 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 57.12 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 56.68 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 671.41 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19043.07 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 842.0 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -635.9 MB). Peak memory consumption was 587.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 443]: 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: 303]: Loop Invariant Derived loop invariant: ((((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) - InvariantResult [Line: 378]: Loop Invariant Derived loop invariant: (((((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((~p5_new == v_prenex_1 % 256 && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) || (((((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || (((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && (exists v_prenex_1 : int :: ((~p5_new == v_prenex_1 % 256 && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: (((((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) || ((((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || (((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 334]: Loop Invariant Derived loop invariant: ((((((((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 0 <= ~send5) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127)) || (((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || (((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || ((((((((~send3 <= 127 && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || (((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: (((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 0 <= ~send5) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) - InvariantResult [Line: 402]: Loop Invariant Derived loop invariant: (((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) || (((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: (((((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) || ((((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || (((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 417]: Loop Invariant Derived loop invariant: ((((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && 1 <= check_~tmp~108) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) || ((((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && 1 <= check_~tmp~108) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: ((((((((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 0 <= ~send5) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127)) || (((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || (((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || ((((((((~send3 <= 127 && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || (((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) - InvariantResult [Line: 407]: Loop Invariant Derived loop invariant: (((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) || (((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode4 / 256 <= 0) && ~send3 <= 127) && 1 <= ~mode4) && assert_~arg == 1) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && 1 <= check_~tmp~108) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) || (((((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && assert_~arg == 1) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && 1 <= check_~tmp~108) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: (((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 0 <= ~send5) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 18.9s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 4.6s AutomataDifference, 0.0s DeadEndRemovalTime, 7.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 283 SDtfs, 273 SDslu, 241 SDs, 0 SdLazy, 194 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1205occurred 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.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 437 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 281 NumberOfFragments, 2428 HoareAnnotationTreeSize, 16 FomulaSimplifications, 16329 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 16 FomulaSimplificationsInter, 780 FormulaSimplificationTreeSizeReductionInter, 7.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 365 NumberOfCodeBlocks, 365 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 416 ConstructedInterpolants, 7 QuantifiedInterpolants, 77429 SizeOfPredicates, 4 NumberOfNonLiveVariables, 491 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 498/510 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...