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-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:42:29,514 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:42:29,516 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:42:29,528 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:42:29,529 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:42:29,530 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:42:29,532 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:42:29,534 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:42:29,537 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:42:29,537 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:42:29,540 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:42:29,540 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:42:29,542 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:42:29,543 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:42:29,551 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:42:29,552 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:42:29,553 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:42:29,555 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:42:29,557 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:42:29,562 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:42:29,564 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:42:29,565 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:42:29,567 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:42:29,567 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:42:29,568 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:42:29,568 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:42:29,569 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:42:29,570 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:42:29,573 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:42:29,574 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:42:29,574 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:42:29,576 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:42:29,576 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:42:29,576 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:42:29,577 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:42:29,578 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:42:29,578 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:42:29,599 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:42:29,600 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:42:29,600 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:42:29,601 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:42:29,601 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:42:29,601 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:42:29,602 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:42:29,602 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:42:29,602 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:42:29,602 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:42:29,602 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:42:29,603 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:42:29,603 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:42:29,603 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:42:29,603 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:42:29,604 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:42:29,604 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:42:29,604 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:42:29,606 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:42:29,606 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:42:29,606 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:42:29,607 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:42:29,607 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:42:29,607 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:42:29,607 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:42:29,607 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:42:29,607 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:42:29,608 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:42:29,608 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:42:29,608 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:42:29,608 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:42:29,609 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:42:29,609 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:42:29,609 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:42:29,609 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:42:29,610 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:42:29,610 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:42:29,610 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:42:29,610 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:42:29,610 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:42:29,611 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:42:29,651 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:42:29,664 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:42:29,672 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:42:29,674 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:42:29,674 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:42:29,675 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl [2018-12-03 16:42:29,675 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl' [2018-12-03 16:42:29,762 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:42:29,764 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:42:29,765 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:42:29,765 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:42:29,765 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:42:29,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:29" (1/1) ... [2018-12-03 16:42:29,803 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:29" (1/1) ... [2018-12-03 16:42:29,817 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:42:29,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:42:29,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:42:29,818 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:42:29,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:29" (1/1) ... [2018-12-03 16:42:29,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:29" (1/1) ... [2018-12-03 16:42:29,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:29" (1/1) ... [2018-12-03 16:42:29,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:29" (1/1) ... [2018-12-03 16:42:29,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:29" (1/1) ... [2018-12-03 16:42:29,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:29" (1/1) ... [2018-12-03 16:42:29,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:29" (1/1) ... [2018-12-03 16:42:29,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:42:29,866 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:42:29,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:42:29,866 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:42:29,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:29" (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:42:29,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:42:29,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:42:30,690 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:42:30,691 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:42:30,691 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:42:30 BoogieIcfgContainer [2018-12-03 16:42:30,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:42:30,692 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:42:30,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:42:30,695 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:42:30,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:29" (1/2) ... [2018-12-03 16:42:30,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34124d41 and model type pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:42:30, skipping insertion in model container [2018-12-03 16:42:30,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:42:30" (2/2) ... [2018-12-03 16:42:30,699 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl [2018-12-03 16:42:30,708 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:42:30,716 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:42:30,733 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:42:30,767 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:42:30,767 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:42:30,767 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:42:30,767 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:42:30,768 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:42:30,768 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:42:30,768 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:42:30,768 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:42:30,782 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-12-03 16:42:30,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:42:30,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:30,789 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:30,792 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:30,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:30,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-12-03 16:42:30,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:30,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:30,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:30,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:30,861 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:31,089 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:42:31,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:31,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:31,093 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:31,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:31,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:31,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:31,113 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-12-03 16:42:31,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:31,156 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-12-03 16:42:31,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:31,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 16:42:31,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:31,168 INFO L225 Difference]: With dead ends: 57 [2018-12-03 16:42:31,168 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:42:31,172 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:42:31,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:42:31,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-12-03 16:42:31,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 16:42:31,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-12-03 16:42:31,214 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-12-03 16:42:31,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:31,215 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-12-03 16:42:31,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:31,215 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-12-03 16:42:31,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:42:31,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:31,216 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:31,216 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:31,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:31,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-12-03 16:42:31,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:31,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:31,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:31,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:31,220 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:31,357 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:42:31,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:31,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:31,358 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:31,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:31,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:31,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:31,361 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-12-03 16:42:31,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:31,430 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-12-03 16:42:31,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:31,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 16:42:31,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:31,433 INFO L225 Difference]: With dead ends: 103 [2018-12-03 16:42:31,433 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 16:42:31,434 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:42:31,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 16:42:31,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-12-03 16:42:31,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 16:42:31,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-12-03 16:42:31,462 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-12-03 16:42:31,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:31,462 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-12-03 16:42:31,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:31,463 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-12-03 16:42:31,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:42:31,464 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:31,464 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:31,464 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:31,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:31,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-12-03 16:42:31,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:31,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:31,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:31,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:31,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:31,733 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:42:31,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:31,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:42:31,734 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:31,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:42:31,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:42:31,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:42:31,735 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-12-03 16:42:31,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:31,888 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-12-03 16:42:31,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:42:31,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-03 16:42:31,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:31,893 INFO L225 Difference]: With dead ends: 141 [2018-12-03 16:42:31,893 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 16:42:31,894 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:42:31,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 16:42:31,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-12-03 16:42:31,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 16:42:31,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-12-03 16:42:31,936 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-12-03 16:42:31,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:31,937 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-12-03 16:42:31,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:42:31,937 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-12-03 16:42:31,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:42:31,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:31,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:31,938 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:31,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:31,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-12-03 16:42:31,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:31,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:31,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:31,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:31,945 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:32,036 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:42:32,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:32,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:32,038 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:32,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:32,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:32,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:32,039 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-12-03 16:42:32,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:32,136 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-12-03 16:42:32,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:32,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 16:42:32,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:32,138 INFO L225 Difference]: With dead ends: 183 [2018-12-03 16:42:32,139 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 16:42:32,143 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:42:32,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 16:42:32,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 16:42:32,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 16:42:32,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-12-03 16:42:32,183 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-12-03 16:42:32,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:32,184 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-12-03 16:42:32,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:32,184 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-12-03 16:42:32,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:42:32,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:32,186 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:32,186 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:32,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:32,186 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-12-03 16:42:32,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:32,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:32,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:32,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:32,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:32,363 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:32,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:32,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:32,364 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:32,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:32,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:32,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:32,366 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-12-03 16:42:32,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:32,438 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-12-03 16:42:32,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:32,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 16:42:32,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:32,441 INFO L225 Difference]: With dead ends: 321 [2018-12-03 16:42:32,441 INFO L226 Difference]: Without dead ends: 215 [2018-12-03 16:42:32,444 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:42:32,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-03 16:42:32,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-12-03 16:42:32,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-03 16:42:32,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-12-03 16:42:32,506 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-12-03 16:42:32,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:32,506 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-12-03 16:42:32,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:32,507 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-12-03 16:42:32,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:42:32,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:32,509 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:32,510 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:32,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:32,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-12-03 16:42:32,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:32,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:32,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:32,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:32,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:32,656 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:32,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:32,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:32,657 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:32,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:32,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:32,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:32,659 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-12-03 16:42:32,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:32,781 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-12-03 16:42:32,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:32,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 16:42:32,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:32,785 INFO L225 Difference]: With dead ends: 633 [2018-12-03 16:42:32,785 INFO L226 Difference]: Without dead ends: 423 [2018-12-03 16:42:32,787 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:42:32,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-12-03 16:42:32,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-12-03 16:42:32,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-03 16:42:32,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-12-03 16:42:32,875 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-12-03 16:42:32,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:32,875 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-12-03 16:42:32,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:32,876 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-12-03 16:42:32,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:42:32,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:32,878 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:32,878 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:32,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:32,879 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-12-03 16:42:32,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:32,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:32,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:32,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:32,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:33,012 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:33,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:33,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:33,013 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:33,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:33,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:33,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:33,014 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-12-03 16:42:33,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:33,214 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-12-03 16:42:33,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:33,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 16:42:33,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:33,219 INFO L225 Difference]: With dead ends: 1257 [2018-12-03 16:42:33,219 INFO L226 Difference]: Without dead ends: 839 [2018-12-03 16:42:33,221 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:42:33,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-12-03 16:42:33,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-12-03 16:42:33,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-12-03 16:42:33,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-12-03 16:42:33,352 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-12-03 16:42:33,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:33,352 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-12-03 16:42:33,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:33,353 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-12-03 16:42:33,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:42:33,355 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:33,355 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:33,356 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:33,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:33,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-12-03 16:42:33,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:33,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:33,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:33,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:33,358 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:33,582 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 16:42:33,586 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:33,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:33,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:33,587 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:33,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:33,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:33,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:33,588 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-12-03 16:42:33,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:33,891 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-12-03 16:42:33,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:33,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 16:42:33,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:33,901 INFO L225 Difference]: With dead ends: 2505 [2018-12-03 16:42:33,901 INFO L226 Difference]: Without dead ends: 1671 [2018-12-03 16:42:33,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:33,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-12-03 16:42:34,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-12-03 16:42:34,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-12-03 16:42:34,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-12-03 16:42:34,162 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-12-03 16:42:34,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:34,163 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-12-03 16:42:34,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:34,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-12-03 16:42:34,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:42:34,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:34,166 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:34,167 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:34,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:34,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-12-03 16:42:34,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:34,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:34,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:34,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:34,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:34,443 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 16:42:34,467 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:42:34,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:34,468 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:42:34,469 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-12-03 16:42:34,471 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50], [54], [56], [58], [62], [64], [66] [2018-12-03 16:42:34,514 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:42:34,515 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:42:36,411 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:42:36,413 INFO L272 AbstractInterpreter]: Visited 26 different actions 244 times. Merged at 25 different actions 155 times. Widened at 16 different actions 16 times. Found 62 fixpoints after 17 different actions. Largest state had 0 variables. [2018-12-03 16:42:36,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:36,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:42:36,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:36,460 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:42:36,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:36,478 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:42:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:36,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:42:36,898 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-12-03 16:42:36,917 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:42:36,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:42:37,293 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-03 16:42:37,452 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:37,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:42:37,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 8 [2018-12-03 16:42:37,480 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:42:37,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:42:37,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:42:37,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:42:37,482 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 6 states. [2018-12-03 16:42:38,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:38,128 INFO L93 Difference]: Finished difference Result 3897 states and 4918 transitions. [2018-12-03 16:42:38,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:42:38,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-12-03 16:42:38,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:38,141 INFO L225 Difference]: With dead ends: 3897 [2018-12-03 16:42:38,142 INFO L226 Difference]: Without dead ends: 2743 [2018-12-03 16:42:38,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:42:38,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2743 states. [2018-12-03 16:42:38,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2743 to 2693. [2018-12-03 16:42:38,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2693 states. [2018-12-03 16:42:38,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 3316 transitions. [2018-12-03 16:42:38,466 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 3316 transitions. Word has length 34 [2018-12-03 16:42:38,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:38,466 INFO L480 AbstractCegarLoop]: Abstraction has 2693 states and 3316 transitions. [2018-12-03 16:42:38,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:42:38,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 3316 transitions. [2018-12-03 16:42:38,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 16:42:38,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:38,472 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 16:42:38,472 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:38,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:38,472 INFO L82 PathProgramCache]: Analyzing trace with hash 2071685859, now seen corresponding path program 2 times [2018-12-03 16:42:38,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:38,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:38,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:38,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:38,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:38,758 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2018-12-03 16:42:39,005 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-12-03 16:42:39,220 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-12-03 16:42:39,245 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-03 16:42:39,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:39,245 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:42:39,245 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:42:39,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:42:39,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:39,246 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:42:39,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:42:39,264 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:42:39,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:42:39,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:42:39,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:42:39,766 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 19 [2018-12-03 16:42:39,971 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 36 proven. 40 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 16:42:39,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:42:40,222 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 36 proven. 40 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 16:42:40,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:42:40,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 16:42:40,250 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:42:40,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:42:40,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:42:40,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:42:40,252 INFO L87 Difference]: Start difference. First operand 2693 states and 3316 transitions. Second operand 7 states. [2018-12-03 16:42:40,683 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-03 16:42:41,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:41,500 INFO L93 Difference]: Finished difference Result 4771 states and 5879 transitions. [2018-12-03 16:42:41,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:42:41,500 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2018-12-03 16:42:41,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:41,507 INFO L225 Difference]: With dead ends: 4771 [2018-12-03 16:42:41,507 INFO L226 Difference]: Without dead ends: 1353 [2018-12-03 16:42:41,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:42:41,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2018-12-03 16:42:41,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1223. [2018-12-03 16:42:41,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2018-12-03 16:42:41,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1452 transitions. [2018-12-03 16:42:41,743 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1452 transitions. Word has length 66 [2018-12-03 16:42:41,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:41,744 INFO L480 AbstractCegarLoop]: Abstraction has 1223 states and 1452 transitions. [2018-12-03 16:42:41,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:42:41,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1452 transitions. [2018-12-03 16:42:41,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 16:42:41,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:41,746 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 16:42:41,746 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:41,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:41,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-12-03 16:42:41,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:41,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:41,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:42:41,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:41,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:41,830 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-03 16:42:41,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:41,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:41,831 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:41,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:41,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:41,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:41,832 INFO L87 Difference]: Start difference. First operand 1223 states and 1452 transitions. Second operand 3 states. [2018-12-03 16:42:41,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:41,865 INFO L93 Difference]: Finished difference Result 1223 states and 1452 transitions. [2018-12-03 16:42:41,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:41,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-03 16:42:41,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:41,866 INFO L225 Difference]: With dead ends: 1223 [2018-12-03 16:42:41,866 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:42:41,868 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:42:41,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:42:41,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:42:41,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:42:41,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:42:41,869 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-12-03 16:42:41,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:41,869 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:42:41,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:41,869 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:42:41,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:42:41,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:42:41,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:41,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:41,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:41,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:41,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:41,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:42,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:42,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:42,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:42,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:42,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:42,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:42,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:42,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:42,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:42,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:42,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:42,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:42,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:42,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:42,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:42,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:42,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:42,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:42,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:43,804 WARN L180 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2018-12-03 16:42:44,352 WARN L180 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2018-12-03 16:42:44,692 WARN L180 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2018-12-03 16:42:44,898 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 37 [2018-12-03 16:42:45,104 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-12-03 16:42:45,233 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2018-12-03 16:42:45,442 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2018-12-03 16:42:45,606 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2018-12-03 16:42:45,965 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2018-12-03 16:42:46,115 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2018-12-03 16:42:46,292 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-12-03 16:42:46,484 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2018-12-03 16:42:46,487 INFO L444 ceAbstractionStarter]: At program point L543(lines 366 543) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div ~send1 256) 1))) (.cse2 (<= ~send1 127)) (.cse1 (div ~mode2 256)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 .cse1)) .cse2 .cse3) (and (exists ((v_prenex_1 Int)) (let ((.cse4 (mod v_prenex_1 256))) (and (<= .cse4 127) (= .cse4 ~p1_old) (<= v_prenex_1 127) (< 0 (+ (div v_prenex_1 256) 1))))) (<= 1 ~mode2) .cse0 .cse2 (<= .cse1 0) .cse3))) [2018-12-03 16:42:46,488 INFO L444 ceAbstractionStarter]: At program point L510(lines 510 517) the Hoare annotation is: (and (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (= .cse0 ~p1_old) (<= v_prenex_1 127) (< 0 (+ (div v_prenex_1 256) 1))))) (<= 1 ~mode2) (<= ~r1 1) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= (div ~mode2 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 16:42:46,488 INFO L444 ceAbstractionStarter]: At program point L477(lines 477 487) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (< 0 (+ (div ~send1 256) 1))) (.cse2 (<= ~send1 127)) (.cse3 (<= (div ~mode2 256) 0)) (.cse4 (exists ((v_prenex_1 Int)) (let ((.cse7 (mod v_prenex_1 256))) (and (<= .cse7 127) (<= v_prenex_1 127) (< 0 (+ (div v_prenex_1 256) 1)) (= ~p1_new .cse7))))) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (= ~r1 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 256))) (and (<= .cse6 127) (= .cse6 ~p1_old) (<= v_prenex_1 127) (< 0 (+ (div v_prenex_1 256) 1))))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 16:42:46,488 INFO L444 ceAbstractionStarter]: At program point L531(lines 531 538) the Hoare annotation is: (and (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (= .cse0 ~p1_old) (<= v_prenex_1 127) (< 0 (+ (div v_prenex_1 256) 1))))) (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~158) (<= 1 ~mode2) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= (div ~mode2 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 16:42:46,488 INFO L444 ceAbstractionStarter]: At program point L432(lines 426 433) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (< 0 (+ (div ~send1 256) 1))) (.cse2 (<= ~send1 127)) (.cse3 (<= (div ~mode2 256) 0)) (.cse4 (exists ((v_prenex_1 Int)) (let ((.cse7 (mod v_prenex_1 256))) (and (<= .cse7 127) (<= v_prenex_1 127) (< 0 (+ (div v_prenex_1 256) 1)) (= ~p1_new .cse7))))) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (= ~r1 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 256))) (and (<= .cse6 127) (= .cse6 ~p1_old) (<= v_prenex_1 127) (< 0 (+ (div v_prenex_1 256) 1))))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 16:42:46,488 INFO L444 ceAbstractionStarter]: At program point L457(lines 457 466) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (< 0 (+ (div ~send1 256) 1))) (.cse2 (<= ~send1 127)) (.cse3 (<= (div ~mode2 256) 0)) (.cse4 (exists ((v_prenex_1 Int)) (let ((.cse7 (mod v_prenex_1 256))) (and (<= .cse7 127) (<= v_prenex_1 127) (< 0 (+ (div v_prenex_1 256) 1)) (= ~p1_new .cse7))))) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (= ~r1 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 256))) (and (<= .cse6 127) (= .cse6 ~p1_old) (<= v_prenex_1 127) (< 0 (+ (div v_prenex_1 256) 1))))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 16:42:46,489 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 545) no Hoare annotation was computed. [2018-12-03 16:42:46,489 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 546) no Hoare annotation was computed. [2018-12-03 16:42:46,489 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 546) no Hoare annotation was computed. [2018-12-03 16:42:46,489 INFO L444 ceAbstractionStarter]: At program point L412(lines 406 413) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (< 0 (+ (div ~send1 256) 1))) (.cse2 (<= ~send1 127)) (.cse3 (<= (div ~mode2 256) 0)) (.cse4 (exists ((v_prenex_1 Int)) (let ((.cse7 (mod v_prenex_1 256))) (and (<= .cse7 127) (<= v_prenex_1 127) (< 0 (+ (div v_prenex_1 256) 1)) (= ~p1_new .cse7))))) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 256))) (and (<= .cse6 127) (= .cse6 ~p1_old) (<= v_prenex_1 127) (< 0 (+ (div v_prenex_1 256) 1))))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 16:42:46,490 INFO L444 ceAbstractionStarter]: At program point L437(lines 437 447) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (< 0 (+ (div ~send1 256) 1))) (.cse2 (<= ~send1 127)) (.cse3 (<= (div ~mode2 256) 0)) (.cse4 (exists ((v_prenex_1 Int)) (let ((.cse7 (mod v_prenex_1 256))) (and (<= .cse7 127) (<= v_prenex_1 127) (< 0 (+ (div v_prenex_1 256) 1)) (= ~p1_new .cse7))))) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (= ~r1 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 256))) (and (<= .cse6 127) (= .cse6 ~p1_old) (<= v_prenex_1 127) (< 0 (+ (div v_prenex_1 256) 1))))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 16:42:46,490 INFO L444 ceAbstractionStarter]: At program point L392(lines 383 393) the Hoare annotation is: (let ((.cse6 (div ~mode2 256))) (let ((.cse0 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (<= .cse9 127) (= .cse9 ~p1_old) (<= v_prenex_1 127) (< 0 (+ (div v_prenex_1 256) 1)))))) (.cse1 (<= 1 ~mode2)) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= .cse6 0)) (.cse7 (exists ((v_prenex_1 Int)) (let ((.cse8 (mod v_prenex_1 256))) (and (<= .cse8 127) (<= v_prenex_1 127) (< 0 (+ (div v_prenex_1 256) 1)) (= ~p1_new .cse8))))) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) .cse2 (= ~mode2 (* 256 .cse6)) .cse3 .cse7 .cse5) (and .cse0 (<= ~r1 1) .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse5)))) [2018-12-03 16:42:46,491 INFO L444 ceAbstractionStarter]: At program point L417(lines 417 427) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (< 0 (+ (div ~send1 256) 1))) (.cse2 (<= ~send1 127)) (.cse3 (<= (div ~mode2 256) 0)) (.cse4 (exists ((v_prenex_1 Int)) (let ((.cse7 (mod v_prenex_1 256))) (and (<= .cse7 127) (<= v_prenex_1 127) (< 0 (+ (div v_prenex_1 256) 1)) (= ~p1_new .cse7))))) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 256))) (and (<= .cse6 127) (= .cse6 ~p1_old) (<= v_prenex_1 127) (< 0 (+ (div v_prenex_1 256) 1))))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 16:42:46,491 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 546) no Hoare annotation was computed. [2018-12-03 16:42:46,491 INFO L444 ceAbstractionStarter]: At program point L537(lines 537 544) the Hoare annotation is: false [2018-12-03 16:42:46,491 INFO L444 ceAbstractionStarter]: At program point L397(lines 397 407) the Hoare annotation is: (let ((.cse6 (div ~mode2 256))) (let ((.cse0 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (<= .cse9 127) (= .cse9 ~p1_old) (<= v_prenex_1 127) (< 0 (+ (div v_prenex_1 256) 1)))))) (.cse1 (<= 1 ~mode2)) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= .cse6 0)) (.cse7 (exists ((v_prenex_1 Int)) (let ((.cse8 (mod v_prenex_1 256))) (and (<= .cse8 127) (<= v_prenex_1 127) (< 0 (+ (div v_prenex_1 256) 1)) (= ~p1_new .cse8))))) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) .cse2 (= ~mode2 (* 256 .cse6)) .cse3 .cse7 .cse5) (and .cse0 (<= ~r1 1) .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse5)))) [2018-12-03 16:42:46,491 INFO L444 ceAbstractionStarter]: At program point L492(lines 486 493) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (< 0 (+ (div ~send1 256) 1))) (.cse2 (<= ~send1 127)) (.cse3 (<= (div ~mode2 256) 0)) (.cse4 (exists ((v_prenex_1 Int)) (let ((.cse7 (mod v_prenex_1 256))) (and (<= .cse7 127) (<= v_prenex_1 127) (< 0 (+ (div v_prenex_1 256) 1)) (= ~p1_new .cse7))))) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (= ~r1 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 256))) (and (<= .cse6 127) (= .cse6 ~p1_old) (<= v_prenex_1 127) (< 0 (+ (div v_prenex_1 256) 1))))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 16:42:46,492 INFO L444 ceAbstractionStarter]: At program point L521(lines 516 522) the Hoare annotation is: (and (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (= .cse0 ~p1_old) (<= v_prenex_1 127) (< 0 (+ (div v_prenex_1 256) 1))))) (<= 1 ULTIMATE.start_check_~tmp~158) (<= 1 ~mode2) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= (div ~mode2 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 16:42:46,492 INFO L444 ceAbstractionStarter]: At program point L472(lines 465 473) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (< 0 (+ (div ~send1 256) 1))) (.cse2 (<= ~send1 127)) (.cse3 (<= (div ~mode2 256) 0)) (.cse4 (exists ((v_prenex_1 Int)) (let ((.cse7 (mod v_prenex_1 256))) (and (<= .cse7 127) (<= v_prenex_1 127) (< 0 (+ (div v_prenex_1 256) 1)) (= ~p1_new .cse7))))) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (= ~r1 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 256))) (and (<= .cse6 127) (= .cse6 ~p1_old) (<= v_prenex_1 127) (< 0 (+ (div v_prenex_1 256) 1))))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 16:42:46,492 INFO L444 ceAbstractionStarter]: At program point L373(lines 373 384) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div ~send1 256) 1))) (.cse2 (<= ~send1 127)) (.cse1 (div ~mode2 256)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 .cse1)) .cse2 .cse3) (and (exists ((v_prenex_1 Int)) (let ((.cse4 (mod v_prenex_1 256))) (and (<= .cse4 127) (= .cse4 ~p1_old) (<= v_prenex_1 127) (< 0 (+ (div v_prenex_1 256) 1))))) (<= 1 ~mode2) .cse0 .cse2 (<= .cse1 0) .cse3))) [2018-12-03 16:42:46,492 INFO L444 ceAbstractionStarter]: At program point L452(lines 446 453) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (< 0 (+ (div ~send1 256) 1))) (.cse2 (<= ~send1 127)) (.cse3 (<= (div ~mode2 256) 0)) (.cse4 (exists ((v_prenex_1 Int)) (let ((.cse7 (mod v_prenex_1 256))) (and (<= .cse7 127) (<= v_prenex_1 127) (< 0 (+ (div v_prenex_1 256) 1)) (= ~p1_new .cse7))))) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (= ~r1 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 256))) (and (<= .cse6 127) (= .cse6 ~p1_old) (<= v_prenex_1 127) (< 0 (+ (div v_prenex_1 256) 1))))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 16:42:46,521 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:42:46 BoogieIcfgContainer [2018-12-03 16:42:46,521 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:42:46,522 INFO L168 Benchmark]: Toolchain (without parser) took 16759.21 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: -926.1 MB). Peak memory consumption was 768.4 MB. Max. memory is 7.1 GB. [2018-12-03 16:42:46,523 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:42:46,524 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:42:46,524 INFO L168 Benchmark]: Boogie Preprocessor took 47.36 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:42:46,525 INFO L168 Benchmark]: RCFGBuilder took 825.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-12-03 16:42:46,526 INFO L168 Benchmark]: TraceAbstraction took 15829.35 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -968.4 MB). Peak memory consumption was 726.2 MB. Max. memory is 7.1 GB. [2018-12-03 16:42:46,530 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 53.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.36 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 825.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15829.35 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -968.4 MB). Peak memory consumption was 726.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 545]: 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: 446]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && ~p1_new == v_prenex_1 % 256)) && 0 == ~nomsg + 1) || ((((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && 1 <= ~mode2) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && ~p1_new == v_prenex_1 % 256)) && 0 == ~nomsg + 1) - InvariantResult [Line: 537]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && ~p1_new == v_prenex_1 % 256)) && 0 == ~nomsg + 1) || ((((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && 1 <= ~mode2) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && ~p1_new == v_prenex_1 % 256)) && 0 == ~nomsg + 1) - InvariantResult [Line: 397]: Loop Invariant Derived loop invariant: (((((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || ((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && ~p1_new == v_prenex_1 % 256)) && 0 == ~nomsg + 1)) || ((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && ~p1_new == v_prenex_1 % 256)) && 0 == ~nomsg + 1)) || (((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && ~p1_new == v_prenex_1 % 256)) && 0 == ~nomsg + 1) - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && ~p1_new == v_prenex_1 % 256)) && 0 == ~nomsg + 1) || ((((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && 1 <= ~mode2) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && ~p1_new == v_prenex_1 % 256)) && 0 == ~nomsg + 1) - InvariantResult [Line: 417]: Loop Invariant Derived loop invariant: (((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && ~p1_new == v_prenex_1 % 256)) && 0 == ~nomsg + 1) || ((((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && 1 <= ~mode2) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && ~p1_new == v_prenex_1 % 256)) && 0 == ~nomsg + 1) - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) || ((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 437]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && ~p1_new == v_prenex_1 % 256)) && 0 == ~nomsg + 1) || ((((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && 1 <= ~mode2) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && ~p1_new == v_prenex_1 % 256)) && 0 == ~nomsg + 1) - InvariantResult [Line: 366]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) || ((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && ~p1_new == v_prenex_1 % 256)) && 0 == ~nomsg + 1) || ((((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && 1 <= ~mode2) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && ~p1_new == v_prenex_1 % 256)) && 0 == ~nomsg + 1) - InvariantResult [Line: 516]: Loop Invariant Derived loop invariant: ((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && 1 <= check_~tmp~158) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 510]: Loop Invariant Derived loop invariant: ((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && 1 <= ~mode2) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 531]: Loop Invariant Derived loop invariant: (((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && assert_~arg == 1) && 1 <= check_~tmp~158) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 383]: Loop Invariant Derived loop invariant: (((((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || ((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && ~p1_new == v_prenex_1 % 256)) && 0 == ~nomsg + 1)) || ((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && ~p1_new == v_prenex_1 % 256)) && 0 == ~nomsg + 1)) || (((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && ~p1_new == v_prenex_1 % 256)) && 0 == ~nomsg + 1) - InvariantResult [Line: 477]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && ~p1_new == v_prenex_1 % 256)) && 0 == ~nomsg + 1) || ((((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && 1 <= ~mode2) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && ~p1_new == v_prenex_1 % 256)) && 0 == ~nomsg + 1) - InvariantResult [Line: 406]: Loop Invariant Derived loop invariant: (((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && ~p1_new == v_prenex_1 % 256)) && 0 == ~nomsg + 1) || ((((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && 1 <= ~mode2) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && ~p1_new == v_prenex_1 % 256)) && 0 == ~nomsg + 1) - InvariantResult [Line: 426]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && ~p1_new == v_prenex_1 % 256)) && 0 == ~nomsg + 1) || ((((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && 1 <= ~mode2) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 < v_prenex_1 / 256 + 1) && ~p1_new == v_prenex_1 % 256)) && 0 == ~nomsg + 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 15.7s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 4.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 380 SDtfs, 218 SDslu, 290 SDs, 0 SdLazy, 115 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 233 GetRequests, 204 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2693occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.9s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 256 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 749 NumberOfFragments, 1908 HoareAnnotationTreeSize, 17 FomulaSimplifications, 61464 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 17 FomulaSimplificationsInter, 1268 FormulaSimplificationTreeSizeReductionInter, 4.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 474 NumberOfCodeBlocks, 442 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 559 ConstructedInterpolants, 18 QuantifiedInterpolants, 197191 SizeOfPredicates, 11 NumberOfNonLiveVariables, 704 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 376/496 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...