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_oct_cong.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:28:01,546 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:28:01,548 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:28:01,567 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:28:01,567 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:28:01,568 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:28:01,569 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:28:01,571 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:28:01,573 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:28:01,573 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:28:01,574 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:28:01,575 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:28:01,575 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:28:01,576 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:28:01,578 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:28:01,580 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:28:01,581 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:28:01,582 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:28:01,588 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:28:01,592 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:28:01,594 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:28:01,596 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:28:01,599 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:28:01,599 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:28:01,600 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:28:01,601 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:28:01,604 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:28:01,605 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:28:01,606 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:28:01,609 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:28:01,609 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:28:01,611 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:28:01,611 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:28:01,611 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:28:01,612 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:28:01,613 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:28:01,613 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:28:01,638 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:28:01,638 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:28:01,640 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:28:01,640 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:28:01,640 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:28:01,640 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:28:01,640 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:28:01,641 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:28:01,641 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:28:01,642 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:28:01,642 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:28:01,642 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:28:01,642 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:28:01,643 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:28:01,643 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:28:01,643 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:28:01,643 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:28:01,645 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:28:01,646 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:28:01,646 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:28:01,646 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:28:01,646 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:28:01,646 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:28:01,647 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:28:01,647 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:28:01,647 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:28:01,647 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:28:01,647 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:28:01,648 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:28:01,648 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:28:01,648 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:28:01,648 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:28:01,649 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:28:01,649 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:28:01,649 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:28:01,649 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:28:01,649 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:28:01,650 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:28:01,650 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:28:01,711 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:28:01,733 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:28:01,739 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:28:01,742 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:28:01,742 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:28:01,743 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl [2018-12-03 17:28:01,743 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl' [2018-12-03 17:28:01,817 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:28:01,819 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:28:01,820 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:28:01,820 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:28:01,820 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:28:01,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:01" (1/1) ... [2018-12-03 17:28:01,851 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:01" (1/1) ... [2018-12-03 17:28:01,868 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:28:01,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:28:01,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:28:01,869 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:28:01,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:01" (1/1) ... [2018-12-03 17:28:01,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:01" (1/1) ... [2018-12-03 17:28:01,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:01" (1/1) ... [2018-12-03 17:28:01,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:01" (1/1) ... [2018-12-03 17:28:01,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:01" (1/1) ... [2018-12-03 17:28:01,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:01" (1/1) ... [2018-12-03 17:28:01,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:01" (1/1) ... [2018-12-03 17:28:01,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:28:01,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:28:01,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:28:01,902 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:28:01,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:01" (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 17:28:01,974 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 17:28:01,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:28:01,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:28:02,462 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:28:02,462 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 17:28:02,463 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:28:02 BoogieIcfgContainer [2018-12-03 17:28:02,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:28:02,464 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:28:02,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:28:02,468 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:28:02,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:01" (1/2) ... [2018-12-03 17:28:02,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@682f715b and model type pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:28:02, skipping insertion in model container [2018-12-03 17:28:02,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:28:02" (2/2) ... [2018-12-03 17:28:02,472 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl [2018-12-03 17:28:02,482 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:28:02,491 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:28:02,509 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:28:02,545 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:28:02,546 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:28:02,546 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:28:02,546 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:28:02,546 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:28:02,546 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:28:02,547 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:28:02,547 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:28:02,563 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-12-03 17:28:02,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:28:02,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:02,572 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:02,574 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:02,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:02,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027031, now seen corresponding path program 1 times [2018-12-03 17:28:02,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:02,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:02,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:02,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:02,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:02,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:02,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:28:02,793 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:02,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:28:02,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:28:02,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:28:02,812 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-12-03 17:28:02,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:02,877 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2018-12-03 17:28:02,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:28:02,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 17:28:02,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:02,890 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:28:02,890 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 17:28:02,895 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 17:28:02,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 17:28:02,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 17:28:02,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 17:28:02,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-12-03 17:28:02,929 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 14 [2018-12-03 17:28:02,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:02,930 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-12-03 17:28:02,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:28:02,930 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2018-12-03 17:28:02,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:28:02,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:02,931 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:02,932 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:02,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:02,932 INFO L82 PathProgramCache]: Analyzing trace with hash 2081192469, now seen corresponding path program 1 times [2018-12-03 17:28:02,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:02,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:02,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:02,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:02,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:03,054 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 17:28:03,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:03,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:28:03,055 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:03,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:28:03,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:28:03,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:28:03,063 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 3 states. [2018-12-03 17:28:03,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:03,129 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2018-12-03 17:28:03,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:28:03,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 17:28:03,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:03,134 INFO L225 Difference]: With dead ends: 45 [2018-12-03 17:28:03,135 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:28:03,137 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 17:28:03,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:28:03,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-12-03 17:28:03,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 17:28:03,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2018-12-03 17:28:03,155 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 14 [2018-12-03 17:28:03,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:03,155 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2018-12-03 17:28:03,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:28:03,155 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2018-12-03 17:28:03,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:28:03,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:03,158 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:03,158 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:03,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:03,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1820747817, now seen corresponding path program 1 times [2018-12-03 17:28:03,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:03,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:03,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:03,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:03,162 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:03,291 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 17:28:03,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:03,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:28:03,292 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:03,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:28:03,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:28:03,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:28:03,293 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand 3 states. [2018-12-03 17:28:03,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:03,338 INFO L93 Difference]: Finished difference Result 59 states and 80 transitions. [2018-12-03 17:28:03,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:28:03,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 17:28:03,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:03,339 INFO L225 Difference]: With dead ends: 59 [2018-12-03 17:28:03,340 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:28:03,340 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 17:28:03,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:28:03,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 17:28:03,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 17:28:03,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2018-12-03 17:28:03,349 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 14 [2018-12-03 17:28:03,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:03,350 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-12-03 17:28:03,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:28:03,350 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2018-12-03 17:28:03,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:28:03,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:03,351 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:03,351 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:03,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:03,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1664872853, now seen corresponding path program 1 times [2018-12-03 17:28:03,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:03,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:03,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:03,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:03,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:03,456 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 17:28:03,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:03,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:28:03,457 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:03,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:28:03,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:28:03,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:28:03,459 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand 3 states. [2018-12-03 17:28:03,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:03,518 INFO L93 Difference]: Finished difference Result 85 states and 115 transitions. [2018-12-03 17:28:03,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:28:03,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 17:28:03,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:03,520 INFO L225 Difference]: With dead ends: 85 [2018-12-03 17:28:03,521 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 17:28:03,522 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 17:28:03,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 17:28:03,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-12-03 17:28:03,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 17:28:03,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2018-12-03 17:28:03,537 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 14 [2018-12-03 17:28:03,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:03,537 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2018-12-03 17:28:03,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:28:03,537 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2018-12-03 17:28:03,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:28:03,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:03,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:03,539 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:03,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:03,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1607614551, now seen corresponding path program 1 times [2018-12-03 17:28:03,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:03,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:03,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:03,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:03,542 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:03,629 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 17:28:03,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:03,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:28:03,630 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:03,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:28:03,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:28:03,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:28:03,631 INFO L87 Difference]: Start difference. First operand 57 states and 76 transitions. Second operand 4 states. [2018-12-03 17:28:03,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:03,773 INFO L93 Difference]: Finished difference Result 113 states and 152 transitions. [2018-12-03 17:28:03,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:28:03,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-03 17:28:03,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:03,785 INFO L225 Difference]: With dead ends: 113 [2018-12-03 17:28:03,785 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 17:28:03,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:28:03,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 17:28:03,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 65. [2018-12-03 17:28:03,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 17:28:03,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2018-12-03 17:28:03,821 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 14 [2018-12-03 17:28:03,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:03,821 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2018-12-03 17:28:03,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:28:03,822 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2018-12-03 17:28:03,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:28:03,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:03,823 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:03,823 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:03,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:03,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1607674133, now seen corresponding path program 1 times [2018-12-03 17:28:03,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:03,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:03,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:03,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:03,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:03,933 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 17:28:03,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:03,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:28:03,934 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:03,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:28:03,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:28:03,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:28:03,936 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand 4 states. [2018-12-03 17:28:04,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:04,167 INFO L93 Difference]: Finished difference Result 150 states and 195 transitions. [2018-12-03 17:28:04,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:28:04,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-03 17:28:04,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:04,169 INFO L225 Difference]: With dead ends: 150 [2018-12-03 17:28:04,169 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 17:28:04,174 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 17:28:04,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 17:28:04,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 65. [2018-12-03 17:28:04,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 17:28:04,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2018-12-03 17:28:04,211 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 14 [2018-12-03 17:28:04,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:04,214 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2018-12-03 17:28:04,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:28:04,215 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2018-12-03 17:28:04,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 17:28:04,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:04,217 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:04,218 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:04,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:04,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1173123511, now seen corresponding path program 1 times [2018-12-03 17:28:04,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:04,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:04,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:04,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:04,220 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:04,337 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:28:04,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:04,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:04,339 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-03 17:28:04,341 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50] [2018-12-03 17:28:04,404 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:28:04,404 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:28:05,180 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 17:28:16,735 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:28:16,737 INFO L272 AbstractInterpreter]: Visited 19 different actions 164 times. Merged at 15 different actions 98 times. Widened at 14 different actions 37 times. Found 22 fixpoints after 11 different actions. Largest state had 0 variables. [2018-12-03 17:28:16,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:16,783 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:28:17,795 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 61.67% of their original sizes. [2018-12-03 17:28:17,795 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:28:22,014 INFO L418 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-12-03 17:28:22,015 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:28:22,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:28:22,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [3] total 21 [2018-12-03 17:28:22,016 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:22,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 17:28:22,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 17:28:22,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:28:22,019 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand 20 states. [2018-12-03 17:28:33,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:33,705 INFO L93 Difference]: Finished difference Result 193 states and 245 transitions. [2018-12-03 17:28:33,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 17:28:33,706 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2018-12-03 17:28:33,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:33,708 INFO L225 Difference]: With dead ends: 193 [2018-12-03 17:28:33,708 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 17:28:33,710 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=242, Invalid=1090, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 17:28:33,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 17:28:33,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 77. [2018-12-03 17:28:33,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 17:28:33,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2018-12-03 17:28:33,796 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 26 [2018-12-03 17:28:33,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:33,797 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2018-12-03 17:28:33,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 17:28:33,797 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2018-12-03 17:28:33,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 17:28:33,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:33,799 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:33,799 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:33,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:33,800 INFO L82 PathProgramCache]: Analyzing trace with hash -187638373, now seen corresponding path program 2 times [2018-12-03 17:28:33,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:33,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:33,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:33,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:33,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:33,890 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 17:28:33,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:33,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:28:33,891 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:33,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:28:33,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:28:33,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:28:33,892 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand 3 states. [2018-12-03 17:28:34,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:34,010 INFO L93 Difference]: Finished difference Result 135 states and 166 transitions. [2018-12-03 17:28:34,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:28:34,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-12-03 17:28:34,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:34,011 INFO L225 Difference]: With dead ends: 135 [2018-12-03 17:28:34,011 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 17:28:34,012 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 17:28:34,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 17:28:34,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-12-03 17:28:34,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 17:28:34,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2018-12-03 17:28:34,101 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 38 [2018-12-03 17:28:34,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:34,102 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2018-12-03 17:28:34,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:28:34,102 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2018-12-03 17:28:34,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 17:28:34,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:34,103 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:34,104 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:34,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:34,104 INFO L82 PathProgramCache]: Analyzing trace with hash 18128349, now seen corresponding path program 3 times [2018-12-03 17:28:34,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:34,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:34,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:34,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:34,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:34,184 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 17:28:34,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:34,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:28:34,185 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:34,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:28:34,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:28:34,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:28:34,186 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand 3 states. [2018-12-03 17:28:34,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:34,270 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2018-12-03 17:28:34,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:28:34,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-12-03 17:28:34,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:34,271 INFO L225 Difference]: With dead ends: 75 [2018-12-03 17:28:34,271 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 17:28:34,272 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 17:28:34,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 17:28:34,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 17:28:34,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 17:28:34,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 17:28:34,273 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2018-12-03 17:28:34,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:34,273 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 17:28:34,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:28:34,273 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 17:28:34,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 17:28:34,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 17:28:34,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:28:36,147 WARN L180 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 1005 DAG size of output: 993 [2018-12-03 17:28:39,413 WARN L180 SmtUtils]: Spent 3.26 s on a formula simplification. DAG size of input: 1756 DAG size of output: 1752 [2018-12-03 17:28:39,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:28:40,131 WARN L180 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 818 DAG size of output: 810 [2018-12-03 17:28:40,750 WARN L180 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 871 DAG size of output: 866 [2018-12-03 17:28:41,158 WARN L180 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 795 DAG size of output: 786 [2018-12-03 17:28:41,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:28:41,963 WARN L180 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 1005 DAG size of output: 993 [2018-12-03 17:28:42,653 WARN L180 SmtUtils]: Spent 594.00 ms on a formula simplification that was a NOOP. DAG size: 944 [2018-12-03 17:28:42,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:28:43,090 WARN L180 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 818 DAG size of output: 810 [2018-12-03 17:28:43,352 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 653 DAG size of output: 640 [2018-12-03 17:28:43,690 WARN L180 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 722 DAG size of output: 709 [2018-12-03 17:28:45,467 WARN L180 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 1756 DAG size of output: 1752 [2018-12-03 17:28:59,027 WARN L180 SmtUtils]: Spent 13.55 s on a formula simplification. DAG size of input: 992 DAG size of output: 119 [2018-12-03 17:29:31,856 WARN L180 SmtUtils]: Spent 32.82 s on a formula simplification. DAG size of input: 1751 DAG size of output: 148 [2018-12-03 17:29:40,276 WARN L180 SmtUtils]: Spent 8.41 s on a formula simplification. DAG size of input: 809 DAG size of output: 106 [2018-12-03 17:29:48,820 WARN L180 SmtUtils]: Spent 8.54 s on a formula simplification. DAG size of input: 865 DAG size of output: 68 [2018-12-03 17:29:55,811 WARN L180 SmtUtils]: Spent 6.99 s on a formula simplification. DAG size of input: 786 DAG size of output: 64 [2018-12-03 17:30:08,971 WARN L180 SmtUtils]: Spent 13.16 s on a formula simplification. DAG size of input: 992 DAG size of output: 119 [2018-12-03 17:30:10,722 WARN L180 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 415 DAG size of output: 50 [2018-12-03 17:30:21,139 WARN L180 SmtUtils]: Spent 10.41 s on a formula simplification. DAG size of input: 944 DAG size of output: 71 [2018-12-03 17:30:29,599 WARN L180 SmtUtils]: Spent 8.45 s on a formula simplification. DAG size of input: 809 DAG size of output: 106 [2018-12-03 17:30:33,848 WARN L180 SmtUtils]: Spent 4.24 s on a formula simplification. DAG size of input: 640 DAG size of output: 58 [2018-12-03 17:30:39,348 WARN L180 SmtUtils]: Spent 5.50 s on a formula simplification. DAG size of input: 708 DAG size of output: 63 [2018-12-03 17:31:12,225 WARN L180 SmtUtils]: Spent 32.87 s on a formula simplification. DAG size of input: 1751 DAG size of output: 148 [2018-12-03 17:31:12,228 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 47 313) no Hoare annotation was computed. [2018-12-03 17:31:12,229 INFO L444 ceAbstractionStarter]: At program point L219(lines 219 232) the Hoare annotation is: (let ((.cse1 (<= (+ ~p1_new 1) ~st1)) (.cse3 (+ ~p3_new 1)) (.cse2 (<= ~st2 (+ ~nomsg 1)))) (or (and (not (= 0 ~mode2)) (let ((.cse0 (+ ~p2_new 1))) (and (<= ~mode3 1) (= ULTIMATE.start_check_~tmp~77 1) (= ULTIMATE.start_assert_~arg 1) (<= ~mode2 (+ ~p2_old 1)) (= ULTIMATE.start_main_~c1~84 1) (<= 1 (+ ~r1 ~mode3)) (<= (+ ~st3 ~r1) 3) (<= 0 (+ ~p2_new ~st2 1)) (<= (+ ~st3 ~st1) 0) (= |ULTIMATE.start_assert_#in~arg| 1) (<= ~p2_old (+ ~p1_old 128)) (<= ~p1_old ~p1_new) (<= 0 (+ ~p1_old ~mode2 1)) (<= .cse0 ~mode3) (<= (+ ~nomsg ~mode2) 0) .cse1 (<= ~st2 ~st3) (<= ~p2_new ~p1_old) (= .cse0 0) .cse2 (= .cse3 0)))) (let ((.cse4 (+ ~r1 256))) (and (<= 0 (+ ~r1 ~mode1 255)) (<= ~p2_old (+ ~r1 255)) (<= 1 (+ ~send2 ~id3)) (<= ~send3 ~id3) (<= ~id3 ~send3) (<= .cse4 0) (<= ~mode2 .cse4) (<= 512 ~mode3) (<= 0 (+ ~p1_new ~p1_old 2)) (<= (+ ~send2 ~send3) 253) (<= 255 (+ ~alive3 ~nomsg)) (<= ~mode1 (+ ~nomsg 2)) (<= 0 (+ (* 2 ~p3_new) 2)) (<= ~st1 ~mode2) (<= .cse3 ~st1) (<= 0 (+ ~st2 ~p2_old 1)) (<= ~p1_old ~nomsg) (<= (+ ~p1_new ~send2) 126) (<= 0 (+ ~p1_new ~st3 1)) (<= (* 2 ~st3) 0) (<= ~p2_new ~p1_new) (<= ~send3 (+ ~st2 127)) (<= ~alive3 (+ ~p1_new 512)) (<= ~nomsg ~p2_new) .cse1 (<= 0 (+ ~alive2 ~st1)) (<= ~st1 ~id3) (<= (+ ~alive2 ~nomsg) 254) (<= .cse3 ~send2) .cse2)))) [2018-12-03 17:31:12,230 INFO L444 ceAbstractionStarter]: At program point L281(lines 276 282) the Hoare annotation is: (and (not (= 0 ~mode2)) (<= ~mode1 (+ ~nomsg 2)) (<= ULTIMATE.start_check_~tmp~77 (+ ~p1_new 2)) (<= 0 (+ ~p1_new ~st3 1)) (<= 0 (+ ~r1 ~mode1 255)) (<= (+ ~p3_old 1) ~st2) (<= ~nomsg ~p2_new) (<= ~p2_old (+ ~p1_old 128)) (<= 1 (+ ~st2 ULTIMATE.start_check_~tmp~77)) (<= 0 (+ ~r1 ~p2_old 256)) (<= 0 (+ ~p1_old ~p3_old 2)) (<= (+ ~p1_new 1) ~st1) (<= ~mode2 (+ ~p3_new 2)) (<= (+ ~r1 256) 0) (<= ~p1_old ~nomsg) (<= 0 (+ ~r1 ~mode3 255)) (<= (+ ~p3_new 1) ~st1) (<= (* 2 ~st3) 0) (<= 0 (+ ~p1_new ~mode2 1)) (<= ~p2_new ~p1_new) (<= ~st2 (+ ~nomsg 1)) (<= (+ ~st1 ~mode3) 1)) [2018-12-03 17:31:12,230 INFO L444 ceAbstractionStarter]: At program point L310(lines 191 310) the Hoare annotation is: (let ((.cse1 (+ ~r1 256)) (.cse2 (+ ~p3_new 1)) (.cse3 (<= (* 2 ~st3) 0)) (.cse4 (<= (+ ~p1_new 1) ~st1))) (or (let ((.cse0 (+ ~mode1 255))) (and (<= ~send1 ~id1) (<= 512 ~mode3) (<= (+ ~send2 ~send3) 253) (<= ~id1 ~send1) (<= ~r1 ~mode1) (<= 1 (+ ~send2 ~id1)) (<= 1 (+ ~send3 ~id1)) (<= (+ ~mode1 256) 0) (<= (+ ~id1 ~id3) 253) (<= (+ ~send1 ~send2) 253) (<= 1 (+ ~send2 ~id3)) (<= ~send3 ~id3) (<= ~id3 ~send3) (<= ~p2_old .cse0) (<= 0 (+ ~st1 ~p3_old 1)) (<= (+ ~alive1 ~st1) 255) (<= 0 (+ ~alive1 ~p3_new 1)) (<= 0 (+ ~st3 ~p2_old 1)) (<= 255 (+ ~alive3 ~p2_new)) (<= ~mode2 .cse1) (<= 0 (+ ~p1_new ~p1_old 2)) (<= ~st2 .cse2) (<= (+ ~p2_new ~p3_old 2) 0) (<= ~st1 ~mode2) (<= ~send2 (+ ~p3_new 128)) (<= (+ ~nomsg ~p3_old 2) 0) (<= (+ ~send1 ~st1) 127) (<= 0 (+ ~send1 ~id1)) (<= ~p1_old ~nomsg) (<= 0 (+ ~p2_new ~st2 1)) (<= ~alive3 (+ ~mode1 767)) (<= 0 (+ ~st2 ~id3)) .cse3 (<= ~send3 (+ ~st2 127)) (<= ~p3_new .cse0) .cse4 (<= 0 (+ ~alive2 ~st1)) (<= (+ ~alive2 ~nomsg) 254) (<= .cse2 ~send2))) (let ((.cse5 (+ ~nomsg 2))) (and (not (= 0 ~mode2)) (<= 0 (+ ~r1 ~mode1 255)) (<= 0 (+ ~r1 ~p2_old 256)) (<= .cse1 0) (<= 0 (+ ~r1 ~mode3 255)) (<= ~mode1 .cse5) (<= ~mode2 (+ ~p3_new 2)) (<= .cse2 ~st1) (<= 0 (+ ~p1_new ~mode2 1)) (<= (+ ~st1 ~mode3) 1) (<= (+ ~p1_old 2) ULTIMATE.start_assert_~arg) (<= |ULTIMATE.start_assert_#in~arg| (+ ~p3_old 2)) (<= (+ ~p3_old 1) ~st2) (<= 1 (+ ~st2 ULTIMATE.start_check_~tmp~77)) (<= (+ ULTIMATE.start_main_~c1~84 ~p2_old) 128) (<= ULTIMATE.start_assert_~arg .cse5) .cse3 (<= 1 (+ ~st3 ULTIMATE.start_main_~c1~84)) (<= ULTIMATE.start_check_~tmp~77 (+ ~p1_new 2)) (<= ~nomsg ~p2_new) (<= 0 (+ ~p1_old ~p3_old 2)) .cse4 (<= (+ ~p2_new 2) |ULTIMATE.start_assert_#in~arg|) (<= (+ ULTIMATE.start_main_~c1~84 ~st2) 1))))) [2018-12-03 17:31:12,231 INFO L444 ceAbstractionStarter]: At program point L238(lines 231 239) the Hoare annotation is: (let ((.cse1 (<= (+ ~p1_new 1) ~st1)) (.cse0 (+ ~p3_new 1))) (or (and (not (= 0 ~mode2)) (<= 0 (+ ~r1 ~mode1 255)) (<= ~p2_old (+ ~r1 255)) (<= ~send3 ~id3) (<= ~id3 ~send3) (<= (+ ~p2_new ~send3) 253) (<= (+ ~r1 256) 0) (<= 512 ~mode3) (<= ~st1 (+ ~p2_old 1)) (<= (+ ~st2 ~nomsg 1) 0) (<= ~mode1 (+ ~nomsg 2)) (<= ~mode2 (+ ~p3_new 2)) (<= .cse0 ~st1) (<= 0 (+ ~p1_new ~mode2 1)) (<= 0 (+ ~p2_new ~r1 256)) (<= 0 (+ ~st2 ~p2_old 1)) (<= (+ ~st3 ~p2_new) 127) (<= 0 (+ ~p1_new ~st3 1)) (<= (* 2 ~st3) 0) (<= (+ ~mode2 255) ~alive3) (<= ~send3 (+ ~st2 127)) (<= ~alive3 (+ ~p1_new 512)) .cse1 (<= ~st1 ~id3)) (and (<= ~mode3 1) (<= 0 (+ ~p2_new ~p2_old 1)) (= ~mode2 0) (= ULTIMATE.start_check_~tmp~77 1) (= ULTIMATE.start_assert_~arg 1) (= ULTIMATE.start_main_~c1~84 1) (<= 1 (+ ~r1 ~mode3)) (<= 0 (+ ~p2_new ~st2 1)) (<= (+ ~st3 ~st1) 0) (= |ULTIMATE.start_assert_#in~arg| 1) (<= ~p2_old (+ ~p1_old 128)) (<= ~p1_old ~p1_new) (<= ~nomsg ~p2_new) .cse1 (<= ~r1 (+ ~mode2 3)) (<= ~st2 ~st3) (<= ~p2_new ~p1_old) (<= 0 (+ ~mode2 ~mode3)) (= (+ ~p2_new 1) 0) (<= ~st2 (+ ~nomsg 1)) (= .cse0 0)))) [2018-12-03 17:31:12,231 INFO L444 ceAbstractionStarter]: At program point L302(lines 302 308) the Hoare annotation is: (let ((.cse0 (+ ~nomsg 2))) (and (not (= 0 ~mode2)) (<= ~mode1 .cse0) (<= (+ ~p1_old 2) ULTIMATE.start_assert_~arg) (<= ULTIMATE.start_check_~tmp~77 (+ ~p1_new 2)) (<= |ULTIMATE.start_assert_#in~arg| (+ ~p3_old 2)) (<= 0 (+ ~r1 ~mode1 255)) (<= (+ ~p3_old 1) ~st2) (<= ~nomsg ~p2_new) (<= 1 (+ ~st2 ULTIMATE.start_check_~tmp~77)) (<= (+ ULTIMATE.start_main_~c1~84 ~p2_old) 128) (<= 0 (+ ~r1 ~p2_old 256)) (<= 0 (+ ~p1_old ~p3_old 2)) (<= (+ ~p1_new 1) ~st1) (<= ULTIMATE.start_assert_~arg .cse0) (<= ~mode2 (+ ~p3_new 2)) (<= (+ ~r1 256) 0) (<= (+ ~p2_new 2) |ULTIMATE.start_assert_#in~arg|) (<= 0 (+ ~r1 ~mode3 255)) (<= (+ ~p3_new 1) ~st1) (<= (* 2 ~st3) 0) (<= 0 (+ ~p1_new ~mode2 1)) (<= 1 (+ ~st3 ULTIMATE.start_main_~c1~84)) (<= (+ ULTIMATE.start_main_~c1~84 ~st2) 1) (<= (+ ~st1 ~mode3) 1))) [2018-12-03 17:31:12,232 INFO L444 ceAbstractionStarter]: At program point L298(lines 294 299) the Hoare annotation is: (and (not (= 0 ~mode2)) (<= ~mode1 (+ ~nomsg 2)) (<= ULTIMATE.start_check_~tmp~77 (+ ~p1_new 2)) (<= |ULTIMATE.start_assert_#in~arg| (+ ~p3_old 2)) (<= 0 (+ ~r1 ~mode1 255)) (<= (+ ~p3_old 1) ~st2) (<= ~nomsg ~p2_new) (<= 1 (+ ~st2 ULTIMATE.start_check_~tmp~77)) (<= (+ ULTIMATE.start_main_~c1~84 ~p2_old) 128) (<= 0 (+ ~r1 ~p2_old 256)) (<= 0 (+ ~p1_old ~p3_old 2)) (<= (+ ~p1_new 1) ~st1) (<= ~mode2 (+ ~p3_new 2)) (<= (+ ~r1 256) 0) (<= ~p1_old ~nomsg) (<= (+ ~p2_new 2) |ULTIMATE.start_assert_#in~arg|) (<= 0 (+ ~r1 ~mode3 255)) (<= (+ ~p3_new 1) ~st1) (<= (* 2 ~st3) 0) (<= 0 (+ ~p1_new ~mode2 1)) (<= 1 (+ ~st3 ULTIMATE.start_main_~c1~84)) (<= (+ ULTIMATE.start_main_~c1~84 ~st2) 1) (<= (+ ~st1 ~mode3) 1)) [2018-12-03 17:31:12,232 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 312) no Hoare annotation was computed. [2018-12-03 17:31:12,232 INFO L444 ceAbstractionStarter]: At program point L288(lines 288 295) the Hoare annotation is: (and (not (= 0 ~mode2)) (<= ~mode1 (+ ~nomsg 2)) (<= ULTIMATE.start_check_~tmp~77 (+ ~p1_new 2)) (<= 0 (+ ~r1 ~mode1 255)) (<= (+ ~p3_old 1) ~st2) (<= ~nomsg ~p2_new) (<= 1 (+ ~st2 ULTIMATE.start_check_~tmp~77)) (<= (+ ULTIMATE.start_main_~c1~84 ~p2_old) 128) (<= 0 (+ ~r1 ~p2_old 256)) (<= 0 (+ ~p1_old ~p3_old 2)) (<= (+ ~p1_new 1) ~st1) (<= ~mode2 (+ ~p3_new 2)) (<= (+ ~r1 256) 0) (<= ~p1_old ~nomsg) (<= 0 (+ ~r1 ~mode3 255)) (<= (+ ~p3_new 1) ~st1) (<= (* 2 ~st3) 0) (<= 0 (+ ~p1_new ~mode2 1)) (<= 1 (+ ~st3 ULTIMATE.start_main_~c1~84)) (<= ~p2_new ~p1_new) (<= (+ ULTIMATE.start_main_~c1~84 ~st2) 1) (<= (+ ~st1 ~mode3) 1)) [2018-12-03 17:31:12,232 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 47 313) no Hoare annotation was computed. [2018-12-03 17:31:12,233 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 47 313) no Hoare annotation was computed. [2018-12-03 17:31:12,233 INFO L444 ceAbstractionStarter]: At program point L214(lines 208 215) the Hoare annotation is: (let ((.cse1 (<= (+ ~p1_new 1) ~st1)) (.cse3 (+ ~p3_new 1)) (.cse2 (<= ~st2 (+ ~nomsg 1)))) (or (and (not (= 0 ~mode2)) (let ((.cse0 (+ ~p2_new 1))) (and (<= ~mode3 1) (= ULTIMATE.start_check_~tmp~77 1) (= ULTIMATE.start_assert_~arg 1) (<= ~mode2 (+ ~p2_old 1)) (= ULTIMATE.start_main_~c1~84 1) (<= 1 (+ ~r1 ~mode3)) (<= (+ ~st3 ~r1) 3) (<= 0 (+ ~p2_new ~st2 1)) (<= (+ ~st3 ~st1) 0) (= |ULTIMATE.start_assert_#in~arg| 1) (<= ~p2_old (+ ~p1_old 128)) (<= ~p1_old ~p1_new) (<= 0 (+ ~p1_old ~mode2 1)) (<= .cse0 ~mode3) (<= (+ ~nomsg ~mode2) 0) .cse1 (<= ~st2 ~st3) (<= ~p2_new ~p1_old) (= .cse0 0) .cse2 (= .cse3 0)))) (let ((.cse4 (+ ~r1 256))) (and (<= 0 (+ ~r1 ~mode1 255)) (<= ~p2_old (+ ~r1 255)) (<= 1 (+ ~send2 ~id3)) (<= ~send3 ~id3) (<= ~id3 ~send3) (<= .cse4 0) (<= ~mode2 .cse4) (<= 512 ~mode3) (<= 0 (+ ~p1_new ~p1_old 2)) (<= (+ ~send2 ~send3) 253) (<= 255 (+ ~alive3 ~nomsg)) (<= ~mode1 (+ ~nomsg 2)) (<= 0 (+ (* 2 ~p3_new) 2)) (<= ~st1 ~mode2) (<= .cse3 ~st1) (<= 0 (+ ~st2 ~p2_old 1)) (<= ~p1_old ~nomsg) (<= (+ ~p1_new ~send2) 126) (<= 0 (+ ~p1_new ~st3 1)) (<= (* 2 ~st3) 0) (<= ~p2_new ~p1_new) (<= ~send3 (+ ~st2 127)) (<= ~alive3 (+ ~p1_new 512)) (<= ~nomsg ~p2_new) .cse1 (<= 0 (+ ~alive2 ~st1)) (<= ~st1 ~id3) (<= (+ ~alive2 ~nomsg) 254) (<= .cse3 ~send2) .cse2)))) [2018-12-03 17:31:12,233 INFO L444 ceAbstractionStarter]: At program point L243(lines 243 253) the Hoare annotation is: (let ((.cse1 (<= (+ ~p1_new 1) ~st1)) (.cse0 (+ ~p3_new 1))) (or (and (not (= 0 ~mode2)) (<= 0 (+ ~r1 ~mode1 255)) (<= ~p2_old (+ ~r1 255)) (<= ~send3 ~id3) (<= ~id3 ~send3) (<= (+ ~p2_new ~send3) 253) (<= (+ ~r1 256) 0) (<= 512 ~mode3) (<= ~st1 (+ ~p2_old 1)) (<= (+ ~st2 ~nomsg 1) 0) (<= ~mode1 (+ ~nomsg 2)) (<= ~mode2 (+ ~p3_new 2)) (<= .cse0 ~st1) (<= 0 (+ ~p1_new ~mode2 1)) (<= 0 (+ ~p2_new ~r1 256)) (<= 0 (+ ~st2 ~p2_old 1)) (<= (+ ~st3 ~p2_new) 127) (<= 0 (+ ~p1_new ~st3 1)) (<= (* 2 ~st3) 0) (<= (+ ~mode2 255) ~alive3) (<= ~send3 (+ ~st2 127)) (<= ~alive3 (+ ~p1_new 512)) .cse1 (<= ~st1 ~id3)) (and (<= ~mode3 1) (<= 0 (+ ~p2_new ~p2_old 1)) (= ~mode2 0) (= ULTIMATE.start_check_~tmp~77 1) (= ULTIMATE.start_assert_~arg 1) (= ULTIMATE.start_main_~c1~84 1) (<= 1 (+ ~r1 ~mode3)) (<= 0 (+ ~p2_new ~st2 1)) (<= (+ ~st3 ~st1) 0) (= |ULTIMATE.start_assert_#in~arg| 1) (<= ~p2_old (+ ~p1_old 128)) (<= ~p1_old ~p1_new) (<= ~nomsg ~p2_new) .cse1 (<= ~r1 (+ ~mode2 3)) (<= ~st2 ~st3) (<= ~p2_new ~p1_old) (<= 0 (+ ~mode2 ~mode3)) (= (+ ~p2_new 1) 0) (<= ~st2 (+ ~nomsg 1)) (= .cse0 0)))) [2018-12-03 17:31:12,233 INFO L444 ceAbstractionStarter]: At program point L307(lines 307 311) the Hoare annotation is: false [2018-12-03 17:31:12,234 INFO L444 ceAbstractionStarter]: At program point L270(lines 270 277) the Hoare annotation is: (and (not (= 0 ~mode2)) (<= ~mode1 (+ ~nomsg 2)) (<= 0 (+ ~p1_new ~st3 1)) (<= 0 (+ ~r1 ~mode1 255)) (<= (+ ~p3_old 1) ~st2) (<= ~nomsg ~p2_new) (<= ~p2_old (+ ~p1_old 128)) (<= 0 (+ ~r1 ~p2_old 256)) (<= 0 (+ ~p1_old ~p3_old 2)) (<= (+ ~p1_new 1) ~st1) (<= ~mode2 (+ ~p3_new 2)) (<= (+ ~r1 256) 0) (<= ~p1_old ~nomsg) (<= 0 (+ ~r1 ~mode3 255)) (<= (+ ~p3_new 1) ~st1) (<= (* 2 ~st3) 0) (<= 0 (+ ~p1_new ~mode2 1)) (<= ~p2_new ~p1_new) (<= ~st2 (+ ~nomsg 1)) (<= (+ ~st1 ~mode3) 1)) [2018-12-03 17:31:12,234 INFO L444 ceAbstractionStarter]: At program point L196(lines 196 209) the Hoare annotation is: (let ((.cse1 (+ ~r1 256)) (.cse2 (+ ~p3_new 1)) (.cse3 (<= (* 2 ~st3) 0)) (.cse4 (<= (+ ~p1_new 1) ~st1))) (or (let ((.cse0 (+ ~mode1 255))) (and (<= ~send1 ~id1) (<= 512 ~mode3) (<= (+ ~send2 ~send3) 253) (<= ~id1 ~send1) (<= ~r1 ~mode1) (<= 1 (+ ~send2 ~id1)) (<= 1 (+ ~send3 ~id1)) (<= (+ ~mode1 256) 0) (<= (+ ~id1 ~id3) 253) (<= (+ ~send1 ~send2) 253) (<= 1 (+ ~send2 ~id3)) (<= ~send3 ~id3) (<= ~id3 ~send3) (<= ~p2_old .cse0) (<= 0 (+ ~st1 ~p3_old 1)) (<= (+ ~alive1 ~st1) 255) (<= 0 (+ ~alive1 ~p3_new 1)) (<= 0 (+ ~st3 ~p2_old 1)) (<= 255 (+ ~alive3 ~p2_new)) (<= ~mode2 .cse1) (<= 0 (+ ~p1_new ~p1_old 2)) (<= ~st2 .cse2) (<= (+ ~p2_new ~p3_old 2) 0) (<= ~st1 ~mode2) (<= ~send2 (+ ~p3_new 128)) (<= (+ ~nomsg ~p3_old 2) 0) (<= (+ ~send1 ~st1) 127) (<= 0 (+ ~send1 ~id1)) (<= ~p1_old ~nomsg) (<= 0 (+ ~p2_new ~st2 1)) (<= ~alive3 (+ ~mode1 767)) (<= 0 (+ ~st2 ~id3)) .cse3 (<= ~send3 (+ ~st2 127)) (<= ~p3_new .cse0) .cse4 (<= 0 (+ ~alive2 ~st1)) (<= (+ ~alive2 ~nomsg) 254) (<= .cse2 ~send2))) (let ((.cse5 (+ ~nomsg 2))) (and (not (= 0 ~mode2)) (<= 0 (+ ~r1 ~mode1 255)) (<= 0 (+ ~r1 ~p2_old 256)) (<= .cse1 0) (<= 0 (+ ~r1 ~mode3 255)) (<= ~mode1 .cse5) (<= ~mode2 (+ ~p3_new 2)) (<= .cse2 ~st1) (<= 0 (+ ~p1_new ~mode2 1)) (<= (+ ~st1 ~mode3) 1) (<= (+ ~p1_old 2) ULTIMATE.start_assert_~arg) (<= |ULTIMATE.start_assert_#in~arg| (+ ~p3_old 2)) (<= (+ ~p3_old 1) ~st2) (<= 1 (+ ~st2 ULTIMATE.start_check_~tmp~77)) (<= (+ ULTIMATE.start_main_~c1~84 ~p2_old) 128) (<= ULTIMATE.start_assert_~arg .cse5) .cse3 (<= 1 (+ ~st3 ULTIMATE.start_main_~c1~84)) (<= ULTIMATE.start_check_~tmp~77 (+ ~p1_new 2)) (<= ~nomsg ~p2_new) (<= 0 (+ ~p1_old ~p3_old 2)) .cse4 (<= (+ ~p2_new 2) |ULTIMATE.start_assert_#in~arg|) (<= (+ ULTIMATE.start_main_~c1~84 ~st2) 1))))) [2018-12-03 17:31:12,235 INFO L444 ceAbstractionStarter]: At program point L258(lines 252 259) the Hoare annotation is: (let ((.cse0 (+ ~p1_new 1))) (and (<= (+ ~st3 ~st1) 0) (not (= 0 ~mode2)) (<= ~p2_new (+ ~nomsg 128)) (<= 0 (+ ~r1 ~mode1 255)) (<= ~mode3 (+ ~r1 257)) (<= 0 (+ ~r1 ~st2 256)) (<= (+ ~p1_new ~mode2) 0) (<= .cse0 ~st1) (<= ~st2 ~st3) (<= (+ ~r1 256) 0) (<= 0 (+ ~r1 ~mode3 255)) (<= 0 (+ ~p1_new ~mode2 1)) (<= 0 (+ ~p2_new ~r1 256)) (<= ~st2 (+ ~nomsg 1)) (<= (+ ~mode1 ~nomsg) 0) (= (+ ~p3_new 1) 0) (<= ~st2 .cse0))) [2018-12-03 17:31:12,269 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:31:12 BoogieIcfgContainer [2018-12-03 17:31:12,269 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 17:31:12,270 INFO L168 Benchmark]: Toolchain (without parser) took 190452.15 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-12-03 17:31:12,271 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 17:31:12,272 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.79 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 17:31:12,272 INFO L168 Benchmark]: Boogie Preprocessor took 31.72 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 17:31:12,273 INFO L168 Benchmark]: RCFGBuilder took 562.10 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 17:31:12,274 INFO L168 Benchmark]: TraceAbstraction took 189804.89 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-12-03 17:31:12,281 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 48.79 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 31.72 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 562.10 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 189804.89 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 312]: 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: 219]: Loop Invariant Derived loop invariant: (!(0 == ~mode2) && (((((((((((((((((((~mode3 <= 1 && check_~tmp~77 == 1) && assert_~arg == 1) && ~mode2 <= ~p2_old + 1) && main_~c1~84 == 1) && 1 <= ~r1 + ~mode3) && ~st3 + ~r1 <= 3) && 0 <= ~p2_new + ~st2 + 1) && ~st3 + ~st1 <= 0) && assert_#in~arg == 1) && ~p2_old <= ~p1_old + 128) && ~p1_old <= ~p1_new) && 0 <= ~p1_old + ~mode2 + 1) && ~p2_new + 1 <= ~mode3) && ~nomsg + ~mode2 <= 0) && ~p1_new + 1 <= ~st1) && ~st2 <= ~st3) && ~p2_new <= ~p1_old) && ~p2_new + 1 == 0) && ~st2 <= ~nomsg + 1) && ~p3_new + 1 == 0) || (((((((((((((((((((((((((((((0 <= ~r1 + ~mode1 + 255 && ~p2_old <= ~r1 + 255) && 1 <= ~send2 + ~id3) && ~send3 <= ~id3) && ~id3 <= ~send3) && ~r1 + 256 <= 0) && ~mode2 <= ~r1 + 256) && 512 <= ~mode3) && 0 <= ~p1_new + ~p1_old + 2) && ~send2 + ~send3 <= 253) && 255 <= ~alive3 + ~nomsg) && ~mode1 <= ~nomsg + 2) && 0 <= 2 * ~p3_new + 2) && ~st1 <= ~mode2) && ~p3_new + 1 <= ~st1) && 0 <= ~st2 + ~p2_old + 1) && ~p1_old <= ~nomsg) && ~p1_new + ~send2 <= 126) && 0 <= ~p1_new + ~st3 + 1) && 2 * ~st3 <= 0) && ~p2_new <= ~p1_new) && ~send3 <= ~st2 + 127) && ~alive3 <= ~p1_new + 512) && ~nomsg <= ~p2_new) && ~p1_new + 1 <= ~st1) && 0 <= ~alive2 + ~st1) && ~st1 <= ~id3) && ~alive2 + ~nomsg <= 254) && ~p3_new + 1 <= ~send2) && ~st2 <= ~nomsg + 1) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((~send1 <= ~id1 && 512 <= ~mode3) && ~send2 + ~send3 <= 253) && ~id1 <= ~send1) && ~r1 <= ~mode1) && 1 <= ~send2 + ~id1) && 1 <= ~send3 + ~id1) && ~mode1 + 256 <= 0) && ~id1 + ~id3 <= 253) && ~send1 + ~send2 <= 253) && 1 <= ~send2 + ~id3) && ~send3 <= ~id3) && ~id3 <= ~send3) && ~p2_old <= ~mode1 + 255) && 0 <= ~st1 + ~p3_old + 1) && ~alive1 + ~st1 <= 255) && 0 <= ~alive1 + ~p3_new + 1) && 0 <= ~st3 + ~p2_old + 1) && 255 <= ~alive3 + ~p2_new) && ~mode2 <= ~r1 + 256) && 0 <= ~p1_new + ~p1_old + 2) && ~st2 <= ~p3_new + 1) && ~p2_new + ~p3_old + 2 <= 0) && ~st1 <= ~mode2) && ~send2 <= ~p3_new + 128) && ~nomsg + ~p3_old + 2 <= 0) && ~send1 + ~st1 <= 127) && 0 <= ~send1 + ~id1) && ~p1_old <= ~nomsg) && 0 <= ~p2_new + ~st2 + 1) && ~alive3 <= ~mode1 + 767) && 0 <= ~st2 + ~id3) && 2 * ~st3 <= 0) && ~send3 <= ~st2 + 127) && ~p3_new <= ~mode1 + 255) && ~p1_new + 1 <= ~st1) && 0 <= ~alive2 + ~st1) && ~alive2 + ~nomsg <= 254) && ~p3_new + 1 <= ~send2) || (((((((((((((((((((((((!(0 == ~mode2) && 0 <= ~r1 + ~mode1 + 255) && 0 <= ~r1 + ~p2_old + 256) && ~r1 + 256 <= 0) && 0 <= ~r1 + ~mode3 + 255) && ~mode1 <= ~nomsg + 2) && ~mode2 <= ~p3_new + 2) && ~p3_new + 1 <= ~st1) && 0 <= ~p1_new + ~mode2 + 1) && ~st1 + ~mode3 <= 1) && ~p1_old + 2 <= assert_~arg) && assert_#in~arg <= ~p3_old + 2) && ~p3_old + 1 <= ~st2) && 1 <= ~st2 + check_~tmp~77) && main_~c1~84 + ~p2_old <= 128) && assert_~arg <= ~nomsg + 2) && 2 * ~st3 <= 0) && 1 <= ~st3 + main_~c1~84) && check_~tmp~77 <= ~p1_new + 2) && ~nomsg <= ~p2_new) && 0 <= ~p1_old + ~p3_old + 2) && ~p1_new + 1 <= ~st1) && ~p2_new + 2 <= assert_#in~arg) && main_~c1~84 + ~st2 <= 1) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(0 == ~mode2) && 0 <= ~r1 + ~mode1 + 255) && ~p2_old <= ~r1 + 255) && ~send3 <= ~id3) && ~id3 <= ~send3) && ~p2_new + ~send3 <= 253) && ~r1 + 256 <= 0) && 512 <= ~mode3) && ~st1 <= ~p2_old + 1) && ~st2 + ~nomsg + 1 <= 0) && ~mode1 <= ~nomsg + 2) && ~mode2 <= ~p3_new + 2) && ~p3_new + 1 <= ~st1) && 0 <= ~p1_new + ~mode2 + 1) && 0 <= ~p2_new + ~r1 + 256) && 0 <= ~st2 + ~p2_old + 1) && ~st3 + ~p2_new <= 127) && 0 <= ~p1_new + ~st3 + 1) && 2 * ~st3 <= 0) && ~mode2 + 255 <= ~alive3) && ~send3 <= ~st2 + 127) && ~alive3 <= ~p1_new + 512) && ~p1_new + 1 <= ~st1) && ~st1 <= ~id3) || ((((((((((((((((((((~mode3 <= 1 && 0 <= ~p2_new + ~p2_old + 1) && ~mode2 == 0) && check_~tmp~77 == 1) && assert_~arg == 1) && main_~c1~84 == 1) && 1 <= ~r1 + ~mode3) && 0 <= ~p2_new + ~st2 + 1) && ~st3 + ~st1 <= 0) && assert_#in~arg == 1) && ~p2_old <= ~p1_old + 128) && ~p1_old <= ~p1_new) && ~nomsg <= ~p2_new) && ~p1_new + 1 <= ~st1) && ~r1 <= ~mode2 + 3) && ~st2 <= ~st3) && ~p2_new <= ~p1_old) && 0 <= ~mode2 + ~mode3) && ~p2_new + 1 == 0) && ~st2 <= ~nomsg + 1) && ~p3_new + 1 == 0) - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(0 == ~mode2) && ~mode1 <= ~nomsg + 2) && check_~tmp~77 <= ~p1_new + 2) && assert_#in~arg <= ~p3_old + 2) && 0 <= ~r1 + ~mode1 + 255) && ~p3_old + 1 <= ~st2) && ~nomsg <= ~p2_new) && 1 <= ~st2 + check_~tmp~77) && main_~c1~84 + ~p2_old <= 128) && 0 <= ~r1 + ~p2_old + 256) && 0 <= ~p1_old + ~p3_old + 2) && ~p1_new + 1 <= ~st1) && ~mode2 <= ~p3_new + 2) && ~r1 + 256 <= 0) && ~p1_old <= ~nomsg) && ~p2_new + 2 <= assert_#in~arg) && 0 <= ~r1 + ~mode3 + 255) && ~p3_new + 1 <= ~st1) && 2 * ~st3 <= 0) && 0 <= ~p1_new + ~mode2 + 1) && 1 <= ~st3 + main_~c1~84) && main_~c1~84 + ~st2 <= 1) && ~st1 + ~mode3 <= 1 - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(0 == ~mode2) && ~mode1 <= ~nomsg + 2) && check_~tmp~77 <= ~p1_new + 2) && 0 <= ~r1 + ~mode1 + 255) && ~p3_old + 1 <= ~st2) && ~nomsg <= ~p2_new) && 1 <= ~st2 + check_~tmp~77) && main_~c1~84 + ~p2_old <= 128) && 0 <= ~r1 + ~p2_old + 256) && 0 <= ~p1_old + ~p3_old + 2) && ~p1_new + 1 <= ~st1) && ~mode2 <= ~p3_new + 2) && ~r1 + 256 <= 0) && ~p1_old <= ~nomsg) && 0 <= ~r1 + ~mode3 + 255) && ~p3_new + 1 <= ~st1) && 2 * ~st3 <= 0) && 0 <= ~p1_new + ~mode2 + 1) && 1 <= ~st3 + main_~c1~84) && ~p2_new <= ~p1_new) && main_~c1~84 + ~st2 <= 1) && ~st1 + ~mode3 <= 1 - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: (!(0 == ~mode2) && (((((((((((((((((((~mode3 <= 1 && check_~tmp~77 == 1) && assert_~arg == 1) && ~mode2 <= ~p2_old + 1) && main_~c1~84 == 1) && 1 <= ~r1 + ~mode3) && ~st3 + ~r1 <= 3) && 0 <= ~p2_new + ~st2 + 1) && ~st3 + ~st1 <= 0) && assert_#in~arg == 1) && ~p2_old <= ~p1_old + 128) && ~p1_old <= ~p1_new) && 0 <= ~p1_old + ~mode2 + 1) && ~p2_new + 1 <= ~mode3) && ~nomsg + ~mode2 <= 0) && ~p1_new + 1 <= ~st1) && ~st2 <= ~st3) && ~p2_new <= ~p1_old) && ~p2_new + 1 == 0) && ~st2 <= ~nomsg + 1) && ~p3_new + 1 == 0) || (((((((((((((((((((((((((((((0 <= ~r1 + ~mode1 + 255 && ~p2_old <= ~r1 + 255) && 1 <= ~send2 + ~id3) && ~send3 <= ~id3) && ~id3 <= ~send3) && ~r1 + 256 <= 0) && ~mode2 <= ~r1 + 256) && 512 <= ~mode3) && 0 <= ~p1_new + ~p1_old + 2) && ~send2 + ~send3 <= 253) && 255 <= ~alive3 + ~nomsg) && ~mode1 <= ~nomsg + 2) && 0 <= 2 * ~p3_new + 2) && ~st1 <= ~mode2) && ~p3_new + 1 <= ~st1) && 0 <= ~st2 + ~p2_old + 1) && ~p1_old <= ~nomsg) && ~p1_new + ~send2 <= 126) && 0 <= ~p1_new + ~st3 + 1) && 2 * ~st3 <= 0) && ~p2_new <= ~p1_new) && ~send3 <= ~st2 + 127) && ~alive3 <= ~p1_new + 512) && ~nomsg <= ~p2_new) && ~p1_new + 1 <= ~st1) && 0 <= ~alive2 + ~st1) && ~st1 <= ~id3) && ~alive2 + ~nomsg <= 254) && ~p3_new + 1 <= ~send2) && ~st2 <= ~nomsg + 1) - InvariantResult [Line: 252]: Loop Invariant Derived loop invariant: (((((((((((((((~st3 + ~st1 <= 0 && !(0 == ~mode2)) && ~p2_new <= ~nomsg + 128) && 0 <= ~r1 + ~mode1 + 255) && ~mode3 <= ~r1 + 257) && 0 <= ~r1 + ~st2 + 256) && ~p1_new + ~mode2 <= 0) && ~p1_new + 1 <= ~st1) && ~st2 <= ~st3) && ~r1 + 256 <= 0) && 0 <= ~r1 + ~mode3 + 255) && 0 <= ~p1_new + ~mode2 + 1) && 0 <= ~p2_new + ~r1 + 256) && ~st2 <= ~nomsg + 1) && ~mode1 + ~nomsg <= 0) && ~p3_new + 1 == 0) && ~st2 <= ~p1_new + 1 - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(0 == ~mode2) && 0 <= ~r1 + ~mode1 + 255) && ~p2_old <= ~r1 + 255) && ~send3 <= ~id3) && ~id3 <= ~send3) && ~p2_new + ~send3 <= 253) && ~r1 + 256 <= 0) && 512 <= ~mode3) && ~st1 <= ~p2_old + 1) && ~st2 + ~nomsg + 1 <= 0) && ~mode1 <= ~nomsg + 2) && ~mode2 <= ~p3_new + 2) && ~p3_new + 1 <= ~st1) && 0 <= ~p1_new + ~mode2 + 1) && 0 <= ~p2_new + ~r1 + 256) && 0 <= ~st2 + ~p2_old + 1) && ~st3 + ~p2_new <= 127) && 0 <= ~p1_new + ~st3 + 1) && 2 * ~st3 <= 0) && ~mode2 + 255 <= ~alive3) && ~send3 <= ~st2 + 127) && ~alive3 <= ~p1_new + 512) && ~p1_new + 1 <= ~st1) && ~st1 <= ~id3) || ((((((((((((((((((((~mode3 <= 1 && 0 <= ~p2_new + ~p2_old + 1) && ~mode2 == 0) && check_~tmp~77 == 1) && assert_~arg == 1) && main_~c1~84 == 1) && 1 <= ~r1 + ~mode3) && 0 <= ~p2_new + ~st2 + 1) && ~st3 + ~st1 <= 0) && assert_#in~arg == 1) && ~p2_old <= ~p1_old + 128) && ~p1_old <= ~p1_new) && ~nomsg <= ~p2_new) && ~p1_new + 1 <= ~st1) && ~r1 <= ~mode2 + 3) && ~st2 <= ~st3) && ~p2_new <= ~p1_old) && 0 <= ~mode2 + ~mode3) && ~p2_new + 1 == 0) && ~st2 <= ~nomsg + 1) && ~p3_new + 1 == 0) - InvariantResult [Line: 270]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(0 == ~mode2) && ~mode1 <= ~nomsg + 2) && 0 <= ~p1_new + ~st3 + 1) && 0 <= ~r1 + ~mode1 + 255) && ~p3_old + 1 <= ~st2) && ~nomsg <= ~p2_new) && ~p2_old <= ~p1_old + 128) && 0 <= ~r1 + ~p2_old + 256) && 0 <= ~p1_old + ~p3_old + 2) && ~p1_new + 1 <= ~st1) && ~mode2 <= ~p3_new + 2) && ~r1 + 256 <= 0) && ~p1_old <= ~nomsg) && 0 <= ~r1 + ~mode3 + 255) && ~p3_new + 1 <= ~st1) && 2 * ~st3 <= 0) && 0 <= ~p1_new + ~mode2 + 1) && ~p2_new <= ~p1_new) && ~st2 <= ~nomsg + 1) && ~st1 + ~mode3 <= 1 - InvariantResult [Line: 302]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(0 == ~mode2) && ~mode1 <= ~nomsg + 2) && ~p1_old + 2 <= assert_~arg) && check_~tmp~77 <= ~p1_new + 2) && assert_#in~arg <= ~p3_old + 2) && 0 <= ~r1 + ~mode1 + 255) && ~p3_old + 1 <= ~st2) && ~nomsg <= ~p2_new) && 1 <= ~st2 + check_~tmp~77) && main_~c1~84 + ~p2_old <= 128) && 0 <= ~r1 + ~p2_old + 256) && 0 <= ~p1_old + ~p3_old + 2) && ~p1_new + 1 <= ~st1) && assert_~arg <= ~nomsg + 2) && ~mode2 <= ~p3_new + 2) && ~r1 + 256 <= 0) && ~p2_new + 2 <= assert_#in~arg) && 0 <= ~r1 + ~mode3 + 255) && ~p3_new + 1 <= ~st1) && 2 * ~st3 <= 0) && 0 <= ~p1_new + ~mode2 + 1) && 1 <= ~st3 + main_~c1~84) && main_~c1~84 + ~st2 <= 1) && ~st1 + ~mode3 <= 1 - InvariantResult [Line: 276]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(0 == ~mode2) && ~mode1 <= ~nomsg + 2) && check_~tmp~77 <= ~p1_new + 2) && 0 <= ~p1_new + ~st3 + 1) && 0 <= ~r1 + ~mode1 + 255) && ~p3_old + 1 <= ~st2) && ~nomsg <= ~p2_new) && ~p2_old <= ~p1_old + 128) && 1 <= ~st2 + check_~tmp~77) && 0 <= ~r1 + ~p2_old + 256) && 0 <= ~p1_old + ~p3_old + 2) && ~p1_new + 1 <= ~st1) && ~mode2 <= ~p3_new + 2) && ~r1 + 256 <= 0) && ~p1_old <= ~nomsg) && 0 <= ~r1 + ~mode3 + 255) && ~p3_new + 1 <= ~st1) && 2 * ~st3 <= 0) && 0 <= ~p1_new + ~mode2 + 1) && ~p2_new <= ~p1_new) && ~st2 <= ~nomsg + 1) && ~st1 + ~mode3 <= 1 - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((~send1 <= ~id1 && 512 <= ~mode3) && ~send2 + ~send3 <= 253) && ~id1 <= ~send1) && ~r1 <= ~mode1) && 1 <= ~send2 + ~id1) && 1 <= ~send3 + ~id1) && ~mode1 + 256 <= 0) && ~id1 + ~id3 <= 253) && ~send1 + ~send2 <= 253) && 1 <= ~send2 + ~id3) && ~send3 <= ~id3) && ~id3 <= ~send3) && ~p2_old <= ~mode1 + 255) && 0 <= ~st1 + ~p3_old + 1) && ~alive1 + ~st1 <= 255) && 0 <= ~alive1 + ~p3_new + 1) && 0 <= ~st3 + ~p2_old + 1) && 255 <= ~alive3 + ~p2_new) && ~mode2 <= ~r1 + 256) && 0 <= ~p1_new + ~p1_old + 2) && ~st2 <= ~p3_new + 1) && ~p2_new + ~p3_old + 2 <= 0) && ~st1 <= ~mode2) && ~send2 <= ~p3_new + 128) && ~nomsg + ~p3_old + 2 <= 0) && ~send1 + ~st1 <= 127) && 0 <= ~send1 + ~id1) && ~p1_old <= ~nomsg) && 0 <= ~p2_new + ~st2 + 1) && ~alive3 <= ~mode1 + 767) && 0 <= ~st2 + ~id3) && 2 * ~st3 <= 0) && ~send3 <= ~st2 + 127) && ~p3_new <= ~mode1 + 255) && ~p1_new + 1 <= ~st1) && 0 <= ~alive2 + ~st1) && ~alive2 + ~nomsg <= 254) && ~p3_new + 1 <= ~send2) || (((((((((((((((((((((((!(0 == ~mode2) && 0 <= ~r1 + ~mode1 + 255) && 0 <= ~r1 + ~p2_old + 256) && ~r1 + 256 <= 0) && 0 <= ~r1 + ~mode3 + 255) && ~mode1 <= ~nomsg + 2) && ~mode2 <= ~p3_new + 2) && ~p3_new + 1 <= ~st1) && 0 <= ~p1_new + ~mode2 + 1) && ~st1 + ~mode3 <= 1) && ~p1_old + 2 <= assert_~arg) && assert_#in~arg <= ~p3_old + 2) && ~p3_old + 1 <= ~st2) && 1 <= ~st2 + check_~tmp~77) && main_~c1~84 + ~p2_old <= 128) && assert_~arg <= ~nomsg + 2) && 2 * ~st3 <= 0) && 1 <= ~st3 + main_~c1~84) && check_~tmp~77 <= ~p1_new + 2) && ~nomsg <= ~p2_new) && 0 <= ~p1_old + ~p3_old + 2) && ~p1_new + 1 <= ~st1) && ~p2_new + 2 <= assert_#in~arg) && main_~c1~84 + ~st2 <= 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 189.7s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 12.5s AutomataDifference, 0.0s DeadEndRemovalTime, 157.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 193 SDtfs, 273 SDslu, 211 SDs, 0 SdLazy, 211 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 68 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 12.4s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9785245408009637 AbsIntWeakeningRatio, 1.76 AbsIntAvgWeakeningVarsNumRemoved, 1435.6 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 137 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 31 NumberOfFragments, 2161 HoareAnnotationTreeSize, 13 FomulaSimplifications, 480 FormulaSimplificationTreeSizeReduction, 11.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 44129 FormulaSimplificationTreeSizeReductionInter, 146.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 9207 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 78/84 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...