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.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:27:35,097 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:27:35,099 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:27:35,116 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:27:35,116 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:27:35,117 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:27:35,120 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:27:35,122 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:27:35,126 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:27:35,127 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:27:35,129 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:27:35,129 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:27:35,131 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:27:35,131 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:27:35,141 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:27:35,142 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:27:35,143 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:27:35,144 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:27:35,146 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:27:35,147 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:27:35,149 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:27:35,150 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:27:35,152 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:27:35,152 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:27:35,152 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:27:35,157 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:27:35,158 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:27:35,159 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:27:35,160 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:27:35,164 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:27:35,164 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:27:35,165 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:27:35,165 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:27:35,166 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:27:35,167 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:27:35,168 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:27:35,168 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:27:35,198 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:27:35,198 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:27:35,199 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:27:35,199 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:27:35,199 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:27:35,199 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:27:35,202 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:27:35,202 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:27:35,202 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:27:35,204 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:27:35,204 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:27:35,204 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:27:35,204 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:27:35,205 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:27:35,205 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:27:35,206 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:27:35,206 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:27:35,206 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:27:35,206 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:27:35,206 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:27:35,206 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:27:35,207 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:27:35,207 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:27:35,207 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:27:35,207 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:27:35,207 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:27:35,208 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:27:35,208 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:27:35,208 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:27:35,208 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:27:35,208 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:27:35,209 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:27:35,209 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:27:35,209 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:27:35,209 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:27:35,209 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:27:35,209 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:27:35,210 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:27:35,210 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:27:35,239 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:27:35,253 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:27:35,261 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:27:35,263 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:27:35,263 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:27:35,264 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.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl [2018-12-03 17:27:35,265 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl' [2018-12-03 17:27:35,347 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:27:35,349 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:27:35,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:27:35,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:27:35,350 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:27:35,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:35" (1/1) ... [2018-12-03 17:27:35,387 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:35" (1/1) ... [2018-12-03 17:27:35,403 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:27:35,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:27:35,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:27:35,404 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:27:35,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:35" (1/1) ... [2018-12-03 17:27:35,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:35" (1/1) ... [2018-12-03 17:27:35,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:35" (1/1) ... [2018-12-03 17:27:35,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:35" (1/1) ... [2018-12-03 17:27:35,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:35" (1/1) ... [2018-12-03 17:27:35,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:35" (1/1) ... [2018-12-03 17:27:35,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:35" (1/1) ... [2018-12-03 17:27:35,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:27:35,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:27:35,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:27:35,459 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:27:35,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:35" (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:27:35,536 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 17:27:35,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:27:35,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:27:36,088 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:27:36,088 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 17:27:36,089 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:27:36 BoogieIcfgContainer [2018-12-03 17:27:36,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:27:36,090 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:27:36,090 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:27:36,093 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:27:36,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:35" (1/2) ... [2018-12-03 17:27:36,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6e87f and model type pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:27:36, skipping insertion in model container [2018-12-03 17:27:36,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:27:36" (2/2) ... [2018-12-03 17:27:36,097 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl [2018-12-03 17:27:36,107 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:27:36,115 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:27:36,131 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:27:36,162 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:27:36,163 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:27:36,163 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:27:36,163 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:27:36,163 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:27:36,163 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:27:36,164 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:27:36,164 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:27:36,180 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-12-03 17:27:36,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:27:36,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:36,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:27:36,190 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:36,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:36,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027031, now seen corresponding path program 1 times [2018-12-03 17:27:36,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:36,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:36,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:36,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:36,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:36,436 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:27:36,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:27:36,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:27:36,439 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:27:36,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:27:36,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:27:36,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:27:36,463 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 4 states. [2018-12-03 17:27:36,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:36,601 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2018-12-03 17:27:36,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:27:36,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-03 17:27:36,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:36,614 INFO L225 Difference]: With dead ends: 43 [2018-12-03 17:27:36,615 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 17:27:36,618 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:27:36,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 17:27:36,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 17. [2018-12-03 17:27:36,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 17:27:36,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-12-03 17:27:36,652 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 14 [2018-12-03 17:27:36,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:36,653 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-12-03 17:27:36,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:27:36,653 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2018-12-03 17:27:36,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:27:36,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:36,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:27:36,654 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:36,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:36,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1823086613, now seen corresponding path program 1 times [2018-12-03 17:27:36,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:36,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:36,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:36,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:36,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:36,776 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:27:36,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:27:36,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:27:36,779 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:27:36,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:27:36,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:27:36,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:27:36,781 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 4 states. [2018-12-03 17:27:36,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:36,909 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2018-12-03 17:27:36,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:27:36,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-03 17:27:36,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:36,911 INFO L225 Difference]: With dead ends: 47 [2018-12-03 17:27:36,911 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:27:36,912 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:27:36,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:27:36,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-12-03 17:27:36,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:27:36,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-12-03 17:27:36,919 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 14 [2018-12-03 17:27:36,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:36,919 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-03 17:27:36,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:27:36,919 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2018-12-03 17:27:36,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:27:36,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:36,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:27:36,921 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:36,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:36,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1765828311, now seen corresponding path program 1 times [2018-12-03 17:27:36,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:36,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:36,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:36,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:36,923 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:36,993 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:27:36,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:27:36,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:27:36,994 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:27:36,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:27:36,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:27:36,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:27:36,995 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 3 states. [2018-12-03 17:27:37,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:37,025 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2018-12-03 17:27:37,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:27:37,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 17:27:37,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:37,027 INFO L225 Difference]: With dead ends: 49 [2018-12-03 17:27:37,027 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:27:37,029 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:27:37,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:27:37,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 17:27:37,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 17:27:37,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-12-03 17:27:37,048 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 14 [2018-12-03 17:27:37,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:37,049 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-12-03 17:27:37,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:27:37,049 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-12-03 17:27:37,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:27:37,050 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:37,050 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:27:37,051 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:37,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:37,051 INFO L82 PathProgramCache]: Analyzing trace with hash 2023993749, now seen corresponding path program 1 times [2018-12-03 17:27:37,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:37,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:37,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:37,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:37,053 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:37,116 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:27:37,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:27:37,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:27:37,117 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:27:37,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:27:37,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:27:37,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:27:37,118 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 3 states. [2018-12-03 17:27:37,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:37,142 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2018-12-03 17:27:37,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:27:37,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 17:27:37,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:37,144 INFO L225 Difference]: With dead ends: 51 [2018-12-03 17:27:37,144 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:27:37,145 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:27:37,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:27:37,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 17:27:37,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 17:27:37,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2018-12-03 17:27:37,153 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 14 [2018-12-03 17:27:37,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:37,154 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-12-03 17:27:37,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:27:37,154 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2018-12-03 17:27:37,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 17:27:37,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:37,156 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:27:37,156 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:37,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:37,157 INFO L82 PathProgramCache]: Analyzing trace with hash 550402615, now seen corresponding path program 1 times [2018-12-03 17:27:37,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:37,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:37,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:37,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:37,158 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:37,269 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:37,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:37,269 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:37,270 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-03 17:27:37,272 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [16], [18], [22], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50] [2018-12-03 17:27:37,336 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:27:37,337 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:27:38,183 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 17:27:40,253 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:27:40,255 INFO L272 AbstractInterpreter]: Visited 17 different actions 36 times. Merged at 13 different actions 15 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:27:40,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:40,302 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:27:41,856 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 53.56% of their original sizes. [2018-12-03 17:27:41,856 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:27:49,111 INFO L418 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-12-03 17:27:49,112 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:27:49,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:27:49,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [5] total 25 [2018-12-03 17:27:49,113 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:27:49,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 17:27:49,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 17:27:49,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:27:49,117 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 22 states. [2018-12-03 17:28:09,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:09,965 INFO L93 Difference]: Finished difference Result 136 states and 176 transitions. [2018-12-03 17:28:09,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 17:28:09,966 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2018-12-03 17:28:09,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:09,969 INFO L225 Difference]: With dead ends: 136 [2018-12-03 17:28:09,969 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 17:28:09,971 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=293, Invalid=1347, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 17:28:09,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 17:28:10,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 47. [2018-12-03 17:28:10,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 17:28:10,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2018-12-03 17:28:10,110 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 26 [2018-12-03 17:28:10,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:10,110 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2018-12-03 17:28:10,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 17:28:10,110 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2018-12-03 17:28:10,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 17:28:10,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:10,111 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:10,112 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:10,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:10,112 INFO L82 PathProgramCache]: Analyzing trace with hash 943429625, now seen corresponding path program 1 times [2018-12-03 17:28:10,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:10,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:10,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:10,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:10,114 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:10,289 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:10,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:10,290 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:10,290 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-03 17:28:10,290 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50] [2018-12-03 17:28:10,293 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:28:10,294 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:28:10,481 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 17:28:11,951 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:28:11,952 INFO L272 AbstractInterpreter]: Visited 18 different actions 39 times. Merged at 13 different actions 15 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:28:11,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:11,988 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:28:12,795 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 57.25% of their original sizes. [2018-12-03 17:28:12,795 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:28:18,056 INFO L418 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-12-03 17:28:18,056 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:28:18,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:28:18,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [4] total 24 [2018-12-03 17:28:18,056 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:18,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 17:28:18,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 17:28:18,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:28:18,058 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand 22 states. [2018-12-03 17:28:33,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:33,239 INFO L93 Difference]: Finished difference Result 131 states and 163 transitions. [2018-12-03 17:28:33,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 17:28:33,239 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2018-12-03 17:28:33,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:33,242 INFO L225 Difference]: With dead ends: 131 [2018-12-03 17:28:33,242 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 17:28:33,243 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=257, Invalid=1225, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 17:28:33,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 17:28:33,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 59. [2018-12-03 17:28:33,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 17:28:33,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-12-03 17:28:33,413 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 26 [2018-12-03 17:28:33,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:33,413 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-12-03 17:28:33,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 17:28:33,413 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-12-03 17:28:33,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 17:28:33,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:33,415 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:33,415 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:33,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:33,415 INFO L82 PathProgramCache]: Analyzing trace with hash 636968921, now seen corresponding path program 2 times [2018-12-03 17:28:33,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:33,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:33,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:33,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:33,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:33,502 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 17:28:33,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:33,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:28:33,503 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:33,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:28:33,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:28:33,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:28:33,504 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 3 states. [2018-12-03 17:28:33,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:33,719 INFO L93 Difference]: Finished difference Result 107 states and 131 transitions. [2018-12-03 17:28:33,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:28:33,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-12-03 17:28:33,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:33,721 INFO L225 Difference]: With dead ends: 107 [2018-12-03 17:28:33,721 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 17:28:33,722 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:33,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 17:28:33,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2018-12-03 17:28:33,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 17:28:33,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2018-12-03 17:28:33,936 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 38 [2018-12-03 17:28:33,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:33,936 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2018-12-03 17:28:33,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:28:33,937 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2018-12-03 17:28:33,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 17:28:33,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:33,938 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:33,938 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:33,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:33,939 INFO L82 PathProgramCache]: Analyzing trace with hash 895982425, now seen corresponding path program 2 times [2018-12-03 17:28:33,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:33,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:33,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:33,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:33,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:34,029 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 17:28:34,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:34,029 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:34,029 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:34,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:34,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:34,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:28:34,049 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:28:34,050 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:28:34,124 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 17:28:34,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:34,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:34,165 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:28:34,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:34,233 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:28:34,263 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:28:34,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2018-12-03 17:28:34,264 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:34,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:28:34,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:28:34,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:28:34,265 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand 3 states. [2018-12-03 17:28:34,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:34,563 INFO L93 Difference]: Finished difference Result 121 states and 147 transitions. [2018-12-03 17:28:34,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:28:34,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-12-03 17:28:34,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:34,565 INFO L225 Difference]: With dead ends: 121 [2018-12-03 17:28:34,565 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 17:28:34,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:28:34,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 17:28:34,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-12-03 17:28:34,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 17:28:34,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2018-12-03 17:28:34,822 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 38 [2018-12-03 17:28:34,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:34,823 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-12-03 17:28:34,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:28:34,823 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-12-03 17:28:34,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 17:28:34,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:34,824 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:28:34,825 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:34,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:34,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1151773895, now seen corresponding path program 3 times [2018-12-03 17:28:34,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:34,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:34,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:34,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:34,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:34,980 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 42 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-03 17:28:34,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:34,981 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:34,981 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:34,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:34,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:34,981 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:28:34,990 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:28:34,990 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:28:35,062 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:28:35,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:35,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:35,169 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-03 17:28:35,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:35,299 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-03 17:28:35,330 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:28:35,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2018-12-03 17:28:35,331 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:35,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:28:35,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:28:35,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:28:35,332 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 3 states. [2018-12-03 17:28:35,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:35,475 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2018-12-03 17:28:35,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:28:35,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 17:28:35,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:35,476 INFO L225 Difference]: With dead ends: 67 [2018-12-03 17:28:35,476 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 17:28:35,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:28:35,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 17:28:35,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 17:28:35,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 17:28:35,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 17:28:35,478 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-12-03 17:28:35,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:35,478 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 17:28:35,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:28:35,478 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 17:28:35,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 17:28:35,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 17:28:39,196 WARN L180 SmtUtils]: Spent 3.71 s on a formula simplification. DAG size of input: 943 DAG size of output: 943 [2018-12-03 17:28:43,087 WARN L180 SmtUtils]: Spent 3.89 s on a formula simplification. DAG size of input: 1432 DAG size of output: 1432 [2018-12-03 17:28:46,848 WARN L180 SmtUtils]: Spent 3.76 s on a formula simplification. DAG size of input: 1542 DAG size of output: 1539 [2018-12-03 17:28:49,309 WARN L180 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 1514 DAG size of output: 1514 [2018-12-03 17:28:54,955 WARN L180 SmtUtils]: Spent 5.64 s on a formula simplification. DAG size of input: 1978 DAG size of output: 1978 [2018-12-03 17:28:56,671 WARN L180 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 943 DAG size of output: 943 [2018-12-03 17:28:59,132 WARN L180 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 1514 DAG size of output: 1514 [2018-12-03 17:29:04,298 WARN L180 SmtUtils]: Spent 5.16 s on a formula simplification. DAG size of input: 1558 DAG size of output: 1550 [2018-12-03 17:29:09,146 WARN L180 SmtUtils]: Spent 4.84 s on a formula simplification. DAG size of input: 1545 DAG size of output: 1545 [2018-12-03 17:29:14,638 WARN L180 SmtUtils]: Spent 5.49 s on a formula simplification. DAG size of input: 1978 DAG size of output: 1978 [2018-12-03 17:29:18,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:29:20,083 WARN L180 SmtUtils]: Spent 5.44 s on a formula simplification. DAG size of input: 1562 DAG size of output: 1555 [2018-12-03 17:29:22,117 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 952 DAG size of output: 952 [2018-12-03 17:29:43,112 WARN L180 SmtUtils]: Spent 20.99 s on a formula simplification. DAG size of input: 943 DAG size of output: 82 [2018-12-03 17:30:03,886 WARN L180 SmtUtils]: Spent 20.77 s on a formula simplification. DAG size of input: 1432 DAG size of output: 85 [2018-12-03 17:30:33,787 WARN L180 SmtUtils]: Spent 29.90 s on a formula simplification. DAG size of input: 1539 DAG size of output: 91 [2018-12-03 17:31:05,964 WARN L180 SmtUtils]: Spent 32.17 s on a formula simplification. DAG size of input: 1514 DAG size of output: 139 [2018-12-03 17:31:53,427 WARN L180 SmtUtils]: Spent 47.45 s on a formula simplification. DAG size of input: 1978 DAG size of output: 158 [2018-12-03 17:32:13,938 WARN L180 SmtUtils]: Spent 20.51 s on a formula simplification. DAG size of input: 943 DAG size of output: 82 [2018-12-03 17:32:45,892 WARN L180 SmtUtils]: Spent 31.95 s on a formula simplification. DAG size of input: 1514 DAG size of output: 139 [2018-12-03 17:33:21,698 WARN L180 SmtUtils]: Spent 35.80 s on a formula simplification. DAG size of input: 1550 DAG size of output: 99 [2018-12-03 17:33:43,369 WARN L180 SmtUtils]: Spent 21.66 s on a formula simplification. DAG size of input: 1545 DAG size of output: 92 [2018-12-03 17:34:30,457 WARN L180 SmtUtils]: Spent 47.08 s on a formula simplification. DAG size of input: 1978 DAG size of output: 158 [2018-12-03 17:35:00,719 WARN L180 SmtUtils]: Spent 30.26 s on a formula simplification. DAG size of input: 1553 DAG size of output: 102 [2018-12-03 17:35:20,955 WARN L180 SmtUtils]: Spent 20.23 s on a formula simplification. DAG size of input: 952 DAG size of output: 79 [2018-12-03 17:35:20,960 INFO L444 ceAbstractionStarter]: At program point L225(lines 225 235) the Hoare annotation is: (let ((.cse14 (+ ~p3_new 1)) (.cse4 (<= 0 (+ ~p1_new ~p3_new 1)))) (let ((.cse0 (let ((.cse22 (+ ~id2 ~id3))) (let ((.cse16 (<= ~send2 ~id2)) (.cse17 (<= 1 .cse22)) (.cse18 (<= ~id2 ~send2)) (.cse19 (<= .cse22 253)) (.cse20 (<= ULTIMATE.start_main_~i2~84 ~r1))) (or (and .cse16 .cse17 .cse18 .cse19 (<= 0 (+ ~alive2 ~p3_new 257)) .cse20 (<= ~mode1 ~alive3) (<= (+ ~alive2 257) ULTIMATE.start_main_~i2~84) (<= (+ ~r1 ~send2) 128) (<= 0 (+ ~st3 ~mode1)) (<= .cse14 ~send2)) (let ((.cse21 (+ ~p1_new ~id2))) (and .cse16 (<= .cse21 253) .cse17 (<= 1 .cse21) .cse18 .cse19 (<= ~id2 (+ ~r1 127)) (<= ~r1 (+ ~alive2 256)) .cse20 (= ~mode1 1) (<= 0 (+ ULTIMATE.start_main_~i2~84 ~st1)) .cse4 (<= 1 (+ ~send2 ~mode1)) (<= (+ ~r1 ~alive2 1) 0))))))) (.cse1 (let ((.cse15 (+ ~p2_new 1))) (let ((.cse6 (<= ~send3 ~id3)) (.cse7 (<= ~send3 (+ ~nomsg 128))) (.cse8 (<= ~mode2 ~r1)) (.cse9 (<= ~st2 ~st3)) (.cse10 (<= ~st1 ~id3)) (.cse11 (<= ~id3 ~send3)) (.cse12 (= .cse15 0)) (.cse13 (<= ~st2 (+ ~nomsg 1)))) (or (let ((.cse5 (+ ~p1_new ~send3))) (and (<= 1 .cse5) (<= .cse5 253) (<= ~r1 ~st1) (<= 0 (+ ~p2_new ~st2 1)) (<= (+ ~st3 ~st1) 0) (<= (+ ~mode3 256) ~st2) (<= ~alive3 (+ ~st1 255)) (<= ~p1_old ~p3_new) (<= (* 2 ~p1_new) 254) (<= 0 (+ ~p1_old ~mode2 1)) (<= ~nomsg ~p2_new) .cse6 .cse7 .cse8 .cse9 .cse4 .cse10 .cse11 .cse12 .cse13 (<= (+ ~p1_old 1) ~alive3) (= .cse14 0))) (and (not (= ~mode3 0)) (<= ~alive3 .cse15) (<= (+ ~send3 ~p1_old) 253) (<= 0 (+ ~p1_old ~p3_new 1)) (<= (+ ~alive3 ~mode3) 1) (<= (* 2 ~st3) 0) (<= 0 (+ ~p1_new ~p3_new 2)) .cse6 .cse7 (<= (+ ~p1_new 1) ~st1) .cse8 (<= ~r1 (+ ~st2 1)) .cse9 (<= .cse14 ~alive3) .cse10 .cse11 (<= (+ ~nomsg 2) ~r1) .cse12 (<= (+ ~st1 1) ~mode2) .cse13 (<= ~p1_old (+ ~st1 127)))))))) (or (let ((.cse2 (* 2 ULTIMATE.start_assert_~arg)) (.cse3 (* 2 |ULTIMATE.start_assert_#in~arg|))) (and .cse0 .cse1 (<= 2 .cse2) (= ULTIMATE.start_main_~c1~84 1) (<= .cse3 2) (<= .cse2 2) (= ULTIMATE.start_check_~tmp~77 1) (<= 2 .cse3))) (and .cse0 .cse1 .cse4)))) [2018-12-03 17:35:20,961 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 47 318) no Hoare annotation was computed. [2018-12-03 17:35:20,961 INFO L444 ceAbstractionStarter]: At program point L283(lines 279 284) the Hoare annotation is: (let ((.cse0 (+ ~p3_old 1)) (.cse1 (+ ~id2 ~id3))) (and (<= 1 (+ ~p1_old ~id3)) (<= 0 (+ ~p1_new ~st3 1)) (<= .cse0 ~st2) (<= 1 (+ ~st2 ULTIMATE.start_check_~tmp~77)) (<= ~alive3 .cse0) (<= 0 (+ ~p1_old ~p3_new 1)) (<= ~mode2 (+ ~p3_new 2)) (<= (* 2 ~st3) 0) (<= ~p2_new ~p1_new) (<= ~r1 (+ ~alive2 256)) (<= ULTIMATE.start_main_~i2~84 ~r1) (<= (+ ULTIMATE.start_main_~i2~84 ~mode3) 1) (= ~mode1 1) (<= ULTIMATE.start_check_~tmp~77 (+ ~p1_new 2)) (<= 0 (+ ULTIMATE.start_main_~i2~84 ~st1)) (<= .cse1 253) (<= ~send2 ~id2) (<= ~send3 ~id3) (<= (+ ~p1_new ~mode2) 0) (<= (+ ~p1_new 1) ~st1) (<= ~r1 (+ ~p2_new 1)) (<= (+ ~alive2 ~nomsg 257) 0) (<= (+ ~send2 ULTIMATE.start_check_~tmp~77) 128) (<= (+ ~send3 ULTIMATE.start_main_~i2~84) 127) (<= (+ ~p3_new 1) ~alive3) (<= ~st1 ~id3) (<= ~id3 ~send3) (<= 1 .cse1) (<= (+ ~st1 1) ~mode2) (<= (+ ~nomsg 2) ~mode3) (<= (+ ~send3 ~p1_old) 253) (<= ~st2 (+ ~nomsg 1)) (<= ~id2 ~send2) (<= ~p1_old (+ ~st1 127)) (<= 1 (+ ~send2 ~mode1)))) [2018-12-03 17:35:20,962 INFO L444 ceAbstractionStarter]: At program point L240(lines 234 241) the Hoare annotation is: (let ((.cse1 (+ ~p1_new ~id2)) (.cse0 (+ ~p2_new 1)) (.cse2 (+ ~p3_new 1)) (.cse3 (+ ~id2 ~id3))) (and (<= .cse0 ULTIMATE.start_main_~i2~84) (<= (+ ~p1_new ~id3) 253) (<= (+ ~alive3 ~mode2) 256) (<= 1 .cse1) (<= ~id2 (+ ~r1 127)) (<= ~mode2 (+ ~p3_new 2)) (<= 1 (+ ~p1_new ~send3)) (<= .cse2 ~st1) (<= (* 2 ~st3) 0) (<= ~r1 (+ ~alive2 256)) (<= ~st1 ULTIMATE.start_main_~i2~84) (<= ULTIMATE.start_main_~i2~84 ~r1) (= ~mode1 1) (<= .cse1 253) (<= 0 (+ ULTIMATE.start_main_~i2~84 ~st1)) (<= (* 2 ~p1_new) 254) (<= (+ ~st3 ~mode3 256) 0) (<= .cse3 253) (<= ~send2 ~id2) (<= ~send3 ~id3) (<= 0 (+ ~st3 ~st2)) (<= ~r1 .cse0) (<= (+ ~alive2 ~nomsg 257) 0) (<= (+ ~send3 ULTIMATE.start_main_~i2~84) 127) (<= 0 (+ ~p1_new ~p3_new 1)) (<= .cse2 ~alive3) (<= ~st1 ~id3) (<= ~id3 ~send3) (<= 1 .cse3) (<= (+ ~st1 1) ~mode2) (<= ~st2 (+ ~nomsg 1)) (<= ~id2 ~send2) (<= 1 (+ ~send2 ~mode1)))) [2018-12-03 17:35:20,962 INFO L444 ceAbstractionStarter]: At program point L304(lines 304 310) the Hoare annotation is: (let ((.cse0 (+ ~p3_old 2)) (.cse1 (+ ~id2 ~id3))) (and (<= 2 (+ ~mode1 ~mode3)) (<= |ULTIMATE.start_assert_#in~arg| .cse0) (<= 0 (+ ~p1_new ~st3 1)) (<= 1 (+ ~send3 ~p1_old)) (<= (+ ~p1_new ULTIMATE.start_assert_~arg) 0) (<= 1 (+ ~st2 ULTIMATE.start_check_~tmp~77)) (<= ~id2 (+ ~r1 127)) (<= 0 (+ ~p1_old ~p3_new 1)) (<= (+ ~alive3 ~mode3) 1) (<= ~mode2 (+ ~p3_new 2)) (<= (+ ~p3_new 1) ~st1) (<= (+ ~p1_old ~id3) 253) (<= .cse0 ULTIMATE.start_assert_~arg) (<= ULTIMATE.start_main_~c1~84 ~mode1) (<= (+ ULTIMATE.start_main_~i2~84 ~mode3) 1) (= ~mode1 1) (<= (* 2 ~p1_old) 254) (<= (+ ~nomsg ~p3_old 2) 0) (<= ULTIMATE.start_check_~tmp~77 (+ ~p1_new 2)) (<= ~mode2 ULTIMATE.start_main_~c1~84) (<= 0 (+ ULTIMATE.start_main_~i2~84 ~st1)) (<= .cse1 253) (<= ~send2 ~id2) (<= ~send3 ~id3) (<= (* 2 ~r1) 0) (<= 0 (+ ~alive2 ~nomsg 257)) (<= (+ ~send3 ULTIMATE.start_main_~i2~84) 127) (<= (+ ~p2_new 2) |ULTIMATE.start_assert_#in~arg|) (<= 1 (+ ULTIMATE.start_assert_~arg ~id3)) (<= ~id3 ~send3) (<= 1 .cse1) (<= 0 (+ ~p2_new ~st2 1)) (<= (+ ~st1 1) ~mode2) (<= (+ ~p1_new 1) ~r1) (<= (+ |ULTIMATE.start_assert_#in~arg| ~alive2 255) 0) (<= (+ ~st3 ~st2) 0) (<= |ULTIMATE.start_assert_#in~arg| (+ ~alive3 1)) (<= ~id2 ~send2) (<= 1 (+ ~send2 ~mode1)))) [2018-12-03 17:35:20,962 INFO L444 ceAbstractionStarter]: At program point L300(lines 296 301) the Hoare annotation is: (let ((.cse0 (+ ~id2 ~id3))) (and (<= |ULTIMATE.start_assert_#in~arg| (+ ~p3_old 2)) (<= 1 (+ ~send3 ~p1_old)) (<= (+ ~p3_old 1) ~st2) (<= 1 (+ ~st2 ULTIMATE.start_check_~tmp~77)) (<= 0 (+ ~p1_old ~p3_new 1)) (<= (+ ~alive3 ~mode3) 1) (<= ~mode2 (+ ~p3_new 2)) (<= (* 2 ~st3) 0) (<= 1 (+ ~st3 ULTIMATE.start_main_~c1~84)) (<= (+ ~p1_old ~id3) 253) (<= ~r1 (+ ~alive2 256)) (<= (+ ULTIMATE.start_main_~i2~84 ~mode3) 1) (= ~mode1 1) (<= ULTIMATE.start_check_~tmp~77 (+ ~p1_new 2)) (<= 0 (+ ULTIMATE.start_main_~i2~84 ~st1)) (<= .cse0 253) (<= ~send2 ~id2) (<= ~nomsg ~p2_new) (<= ~send3 ~id3) (<= |ULTIMATE.start_assert_#in~arg| (+ ~r1 1)) (<= (+ ~p1_new ~mode2) 0) (<= (+ ~p1_new 1) ~st1) (<= (+ ~alive2 ~nomsg 257) 0) (<= (+ ~send2 ULTIMATE.start_check_~tmp~77) 128) (<= (+ ~send3 ULTIMATE.start_main_~i2~84) 127) (<= (+ ~p2_new 2) |ULTIMATE.start_assert_#in~arg|) (<= (+ ~p3_new 1) ~alive3) (<= ~st1 ~id3) (<= ~id3 ~send3) (<= 1 .cse0) (<= (+ ULTIMATE.start_main_~c1~84 ~st2) 1) (<= (+ ~st1 1) ~mode2) (<= (+ ~nomsg 2) ~mode3) (<= (+ ULTIMATE.start_main_~c1~84 ~p1_old) 128) (<= ~st2 (+ ~nomsg 1)) (<= ~id2 ~send2) (<= 1 (+ ~send2 ~mode1)))) [2018-12-03 17:35:20,963 INFO L444 ceAbstractionStarter]: At program point L199(lines 199 212) the Hoare annotation is: (let ((.cse15 (<= (+ ~p3_new ~mode3 258) 0)) (.cse14 (+ ~p3_new 1))) (let ((.cse1 (let ((.cse22 (+ ~id2 ~id3))) (let ((.cse16 (<= ~send2 ~id2)) (.cse17 (<= 1 .cse22)) (.cse18 (<= ~id2 ~send2)) (.cse19 (<= .cse22 253)) (.cse20 (<= ~id2 (+ ~r1 127))) (.cse21 (<= ~r1 (+ ~alive2 256)))) (or (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse15 (<= .cse14 ~send2) (<= (+ ~r1 ~alive2 1) 0)) (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (<= (+ ~alive2 ~nomsg 257) 0) (<= 1 (+ ~send2 ~mode1))))))) (.cse3 (let ((.cse7 (+ ~p1_new 1)) (.cse6 (+ ~p3_old 1))) (let ((.cse4 (<= ~send3 ~id3)) (.cse5 (<= ~id3 ~send3)) (.cse8 (<= 0 (+ ~p1_new ~st3 1))) (.cse9 (<= .cse6 ~st2)) (.cse10 (<= .cse7 ~st1)) (.cse11 (<= .cse14 ~alive3)) (.cse12 (<= ~st1 ~id3)) (.cse13 (<= ~st2 (+ ~nomsg 1)))) (or (and .cse4 .cse5 (<= 1 (+ ~send3 ~p1_old)) (<= (+ ~p1_old ~id3) 253) (<= (+ ULTIMATE.start_main_~i2~84 ~mode1) 2) (<= ~alive3 .cse6) (<= ~mode2 (+ ~p3_new 2)) (<= .cse7 ~r1) (<= (+ ~nomsg 2) ~mode3) (<= (+ ULTIMATE.start_main_~i2~84 ~p1_old) 128) .cse8 .cse9 (<= 0 (+ ~p1_old ~p3_new 1)) (<= (+ ~alive3 ~mode3) 1) (<= (+ ~p2_new 2) ULTIMATE.start_main_~i2~84) (<= (* 2 ~st3) 0) (= ~mode1 1) (<= ~id3 (+ ~p3_old 128)) .cse10 (<= ~r1 (+ ~p2_new 1)) .cse11 .cse12 (<= (+ ~st1 1) ~mode2) .cse13) (and (= (mod ~mode3 256) 0) .cse4 .cse5 (<= .cse14 ~st1) (<= 0 (+ ~p1_new ~mode2 1)) .cse8 (<= (+ ~mode1 255) ~p3_new) .cse9 (<= ~p2_new ~p1_new) (<= ~st1 ULTIMATE.start_main_~i2~84) (<= ULTIMATE.start_main_~i2~84 ~r1) .cse15 (<= ~nomsg ~p2_new) (<= (* 2 ~r1) 0) (<= 0 (+ ~p1_old ~p3_old 2)) .cse10 (<= (+ ~send3 ULTIMATE.start_main_~i2~84) 127) (<= (+ ~alive3 ~p3_old) 254) .cse11 .cse12 (<= ~st3 (+ ~mode1 256)) .cse13 (<= (+ ~p1_old ~mode2 1) 0))))))) (or (let ((.cse2 (* 2 |ULTIMATE.start_assert_#in~arg|))) (and (<= 1 ~mode2) (let ((.cse0 (* 2 ULTIMATE.start_main_~c1~84))) (and (= ULTIMATE.start_assert_~arg 1) (<= .cse0 2) .cse1 (<= 2 .cse0))) (<= .cse2 2) .cse3 (= ULTIMATE.start_check_~tmp~77 1) (<= 2 .cse2))) (and (and (<= (+ ~send1 ~send3) 253) (<= 1 (+ ~send1 ~id2)) (<= (+ ~send1 ~send2) 253) (<= 1 (+ ~send1 ~id3)) (<= 0 (+ ~send1 ~st1)) (<= (+ ULTIMATE.start_main_~i2~84 256) ~alive1) (<= (+ ~send1 ~mode1 129) 0) (<= (+ ~alive1 ~p3_new) 510)) .cse1 .cse3)))) [2018-12-03 17:35:20,963 INFO L444 ceAbstractionStarter]: At program point L290(lines 290 297) the Hoare annotation is: (let ((.cse0 (+ ~id2 ~id3))) (and (<= 0 (+ ~alive2 ~p3_new 257)) (<= 1 (+ ~send3 ~p1_old)) (<= (+ ~p3_old 1) ~st2) (<= 1 (+ ~st2 ULTIMATE.start_check_~tmp~77)) (<= 0 (+ ~p1_old ~p3_new 1)) (<= (+ ~alive3 ~mode3) 1) (<= 0 (+ ~alive2 ~p3_old 257)) (<= (* 2 ~st3) 0) (<= 1 (+ ~st3 ULTIMATE.start_main_~c1~84)) (<= ~p2_new ~p1_new) (<= (+ ~p1_old ~id3) 253) (<= ULTIMATE.start_main_~i2~84 ~r1) (= ~mode1 1) (<= ULTIMATE.start_check_~tmp~77 (+ ~p1_new 2)) (<= 0 (+ ULTIMATE.start_main_~i2~84 ~st1)) (<= .cse0 253) (<= ~send2 ~id2) (<= ~send3 ~id3) (<= (+ ~p1_new ~mode2) 0) (<= (+ ~p1_new 1) ~st1) (<= ~r1 (+ ~p2_new 1)) (<= (+ ~alive2 ~nomsg 257) 0) (<= (+ ~send2 ULTIMATE.start_check_~tmp~77) 128) (<= (+ ~send3 ULTIMATE.start_main_~i2~84) 127) (<= (+ ~p3_new 1) ~alive3) (<= ~st1 ~id3) (<= ~id3 ~send3) (<= 1 .cse0) (<= (+ ~st1 1) ~mode2) (<= (+ ULTIMATE.start_main_~c1~84 ~st2) 1) (<= (+ ~nomsg 2) ~mode3) (<= (+ ULTIMATE.start_main_~c1~84 ~p1_old) 128) (<= ~st2 (+ ~nomsg 1)) (<= ~id2 ~send2) (<= 1 (+ ~send2 ~mode1)))) [2018-12-03 17:35:20,963 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 47 318) no Hoare annotation was computed. [2018-12-03 17:35:20,963 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 47 318) no Hoare annotation was computed. [2018-12-03 17:35:20,964 INFO L444 ceAbstractionStarter]: At program point L220(lines 211 221) the Hoare annotation is: (let ((.cse14 (+ ~p3_new 1)) (.cse4 (<= 0 (+ ~p1_new ~p3_new 1)))) (let ((.cse0 (let ((.cse22 (+ ~id2 ~id3))) (let ((.cse16 (<= ~send2 ~id2)) (.cse17 (<= 1 .cse22)) (.cse18 (<= ~id2 ~send2)) (.cse19 (<= .cse22 253)) (.cse20 (<= ULTIMATE.start_main_~i2~84 ~r1))) (or (and .cse16 .cse17 .cse18 .cse19 (<= 0 (+ ~alive2 ~p3_new 257)) .cse20 (<= ~mode1 ~alive3) (<= (+ ~alive2 257) ULTIMATE.start_main_~i2~84) (<= (+ ~r1 ~send2) 128) (<= 0 (+ ~st3 ~mode1)) (<= .cse14 ~send2)) (let ((.cse21 (+ ~p1_new ~id2))) (and .cse16 (<= .cse21 253) .cse17 (<= 1 .cse21) .cse18 .cse19 (<= ~id2 (+ ~r1 127)) (<= ~r1 (+ ~alive2 256)) .cse20 (= ~mode1 1) (<= 0 (+ ULTIMATE.start_main_~i2~84 ~st1)) .cse4 (<= 1 (+ ~send2 ~mode1)) (<= (+ ~r1 ~alive2 1) 0))))))) (.cse1 (let ((.cse15 (+ ~p2_new 1))) (let ((.cse6 (<= ~send3 ~id3)) (.cse7 (<= ~send3 (+ ~nomsg 128))) (.cse8 (<= ~mode2 ~r1)) (.cse9 (<= ~st2 ~st3)) (.cse10 (<= ~st1 ~id3)) (.cse11 (<= ~id3 ~send3)) (.cse12 (= .cse15 0)) (.cse13 (<= ~st2 (+ ~nomsg 1)))) (or (let ((.cse5 (+ ~p1_new ~send3))) (and (<= 1 .cse5) (<= .cse5 253) (<= ~r1 ~st1) (<= 0 (+ ~p2_new ~st2 1)) (<= (+ ~st3 ~st1) 0) (<= (+ ~mode3 256) ~st2) (<= ~alive3 (+ ~st1 255)) (<= ~p1_old ~p3_new) (<= (* 2 ~p1_new) 254) (<= 0 (+ ~p1_old ~mode2 1)) (<= ~nomsg ~p2_new) .cse6 .cse7 .cse8 .cse9 .cse4 .cse10 .cse11 .cse12 .cse13 (<= (+ ~p1_old 1) ~alive3) (= .cse14 0))) (and (not (= ~mode3 0)) (<= ~alive3 .cse15) (<= (+ ~send3 ~p1_old) 253) (<= 0 (+ ~p1_old ~p3_new 1)) (<= (+ ~alive3 ~mode3) 1) (<= (* 2 ~st3) 0) (<= 0 (+ ~p1_new ~p3_new 2)) .cse6 .cse7 (<= (+ ~p1_new 1) ~st1) .cse8 (<= ~r1 (+ ~st2 1)) .cse9 (<= .cse14 ~alive3) .cse10 .cse11 (<= (+ ~nomsg 2) ~r1) .cse12 (<= (+ ~st1 1) ~mode2) .cse13 (<= ~p1_old (+ ~st1 127)))))))) (or (let ((.cse2 (* 2 ULTIMATE.start_assert_~arg)) (.cse3 (* 2 |ULTIMATE.start_assert_#in~arg|))) (and .cse0 .cse1 (<= 2 .cse2) (= ULTIMATE.start_main_~c1~84 1) (<= .cse3 2) (<= .cse2 2) (= ULTIMATE.start_check_~tmp~77 1) (<= 2 .cse3))) (and .cse0 .cse1 .cse4)))) [2018-12-03 17:35:20,965 INFO L444 ceAbstractionStarter]: At program point L315(lines 193 315) the Hoare annotation is: (let ((.cse15 (<= (+ ~p3_new ~mode3 258) 0)) (.cse14 (+ ~p3_new 1))) (let ((.cse1 (let ((.cse22 (+ ~id2 ~id3))) (let ((.cse16 (<= ~send2 ~id2)) (.cse17 (<= 1 .cse22)) (.cse18 (<= ~id2 ~send2)) (.cse19 (<= .cse22 253)) (.cse20 (<= ~id2 (+ ~r1 127))) (.cse21 (<= ~r1 (+ ~alive2 256)))) (or (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse15 (<= .cse14 ~send2) (<= (+ ~r1 ~alive2 1) 0)) (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (<= (+ ~alive2 ~nomsg 257) 0) (<= 1 (+ ~send2 ~mode1))))))) (.cse3 (let ((.cse7 (+ ~p1_new 1)) (.cse6 (+ ~p3_old 1))) (let ((.cse4 (<= ~send3 ~id3)) (.cse5 (<= ~id3 ~send3)) (.cse8 (<= 0 (+ ~p1_new ~st3 1))) (.cse9 (<= .cse6 ~st2)) (.cse10 (<= .cse7 ~st1)) (.cse11 (<= .cse14 ~alive3)) (.cse12 (<= ~st1 ~id3)) (.cse13 (<= ~st2 (+ ~nomsg 1)))) (or (and .cse4 .cse5 (<= 1 (+ ~send3 ~p1_old)) (<= (+ ~p1_old ~id3) 253) (<= (+ ULTIMATE.start_main_~i2~84 ~mode1) 2) (<= ~alive3 .cse6) (<= ~mode2 (+ ~p3_new 2)) (<= .cse7 ~r1) (<= (+ ~nomsg 2) ~mode3) (<= (+ ULTIMATE.start_main_~i2~84 ~p1_old) 128) .cse8 .cse9 (<= 0 (+ ~p1_old ~p3_new 1)) (<= (+ ~alive3 ~mode3) 1) (<= (+ ~p2_new 2) ULTIMATE.start_main_~i2~84) (<= (* 2 ~st3) 0) (= ~mode1 1) (<= ~id3 (+ ~p3_old 128)) .cse10 (<= ~r1 (+ ~p2_new 1)) .cse11 .cse12 (<= (+ ~st1 1) ~mode2) .cse13) (and (= (mod ~mode3 256) 0) .cse4 .cse5 (<= .cse14 ~st1) (<= 0 (+ ~p1_new ~mode2 1)) .cse8 (<= (+ ~mode1 255) ~p3_new) .cse9 (<= ~p2_new ~p1_new) (<= ~st1 ULTIMATE.start_main_~i2~84) (<= ULTIMATE.start_main_~i2~84 ~r1) .cse15 (<= ~nomsg ~p2_new) (<= (* 2 ~r1) 0) (<= 0 (+ ~p1_old ~p3_old 2)) .cse10 (<= (+ ~send3 ULTIMATE.start_main_~i2~84) 127) (<= (+ ~alive3 ~p3_old) 254) .cse11 .cse12 (<= ~st3 (+ ~mode1 256)) .cse13 (<= (+ ~p1_old ~mode2 1) 0))))))) (or (let ((.cse2 (* 2 |ULTIMATE.start_assert_#in~arg|))) (and (<= 1 ~mode2) (let ((.cse0 (* 2 ULTIMATE.start_main_~c1~84))) (and (= ULTIMATE.start_assert_~arg 1) (<= .cse0 2) .cse1 (<= 2 .cse0))) (<= .cse2 2) .cse3 (= ULTIMATE.start_check_~tmp~77 1) (<= 2 .cse2))) (and (and (<= (+ ~send1 ~send3) 253) (<= 1 (+ ~send1 ~id2)) (<= (+ ~send1 ~send2) 253) (<= 1 (+ ~send1 ~id3)) (<= 0 (+ ~send1 ~st1)) (<= (+ ULTIMATE.start_main_~i2~84 256) ~alive1) (<= (+ ~send1 ~mode1 129) 0) (<= (+ ~alive1 ~p3_new) 510)) .cse1 .cse3)))) [2018-12-03 17:35:20,965 INFO L444 ceAbstractionStarter]: At program point L245(lines 245 254) the Hoare annotation is: (let ((.cse1 (+ ~p1_new ~id2)) (.cse0 (+ ~p2_new 1)) (.cse2 (+ ~p3_new 1)) (.cse3 (+ ~id2 ~id3))) (and (<= .cse0 ULTIMATE.start_main_~i2~84) (<= (+ ~p1_new ~id3) 253) (<= (+ ~alive3 ~mode2) 256) (<= 1 .cse1) (<= ~id2 (+ ~r1 127)) (<= ~mode2 (+ ~p3_new 2)) (<= 1 (+ ~p1_new ~send3)) (<= .cse2 ~st1) (<= (* 2 ~st3) 0) (<= ~r1 (+ ~alive2 256)) (<= ~st1 ULTIMATE.start_main_~i2~84) (<= ULTIMATE.start_main_~i2~84 ~r1) (= ~mode1 1) (<= .cse1 253) (<= 0 (+ ULTIMATE.start_main_~i2~84 ~st1)) (<= (* 2 ~p1_new) 254) (<= (+ ~st3 ~mode3 256) 0) (<= .cse3 253) (<= ~send2 ~id2) (<= ~send3 ~id3) (<= 0 (+ ~st3 ~st2)) (<= ~r1 .cse0) (<= (+ ~alive2 ~nomsg 257) 0) (<= (+ ~send3 ULTIMATE.start_main_~i2~84) 127) (<= 0 (+ ~p1_new ~p3_new 1)) (<= .cse2 ~alive3) (<= ~st1 ~id3) (<= ~id3 ~send3) (<= 1 .cse3) (<= (+ ~st1 1) ~mode2) (<= ~st2 (+ ~nomsg 1)) (<= ~id2 ~send2) (<= 1 (+ ~send2 ~mode1)))) [2018-12-03 17:35:20,965 INFO L444 ceAbstractionStarter]: At program point L309(lines 309 316) the Hoare annotation is: false [2018-12-03 17:35:20,965 INFO L444 ceAbstractionStarter]: At program point L272(lines 272 280) the Hoare annotation is: (let ((.cse0 (+ ~p3_old 1))) (and (<= 0 (+ ~p1_new ~st3 1)) (<= 1 (+ ~send3 ~p1_old)) (<= .cse0 ~st2) (<= ~alive3 .cse0) (<= 0 (+ ~p1_old ~p3_new 1)) (<= 1 (+ ~send2 ~id3)) (<= ~mode2 (+ ~p3_new 2)) (<= (* 2 ~st3) 0) (<= ~p2_new ~p1_new) (<= (+ ~p1_old ~id3) 253) (<= ULTIMATE.start_main_~i2~84 ~r1) (<= (+ ULTIMATE.start_main_~i2~84 ~mode3) 1) (= ~mode1 1) (<= (* 2 ~p1_old) 254) (<= 0 (+ ULTIMATE.start_main_~i2~84 ~st1)) (<= (+ ~id2 ~id3) 253) (<= ~send2 ~id2) (<= ~send3 ~id3) (<= (+ ~p1_new 1) ~st1) (<= ~r1 (+ ~p2_new 1)) (<= ~alive3 (+ ~alive2 256)) (<= (+ ~send3 ULTIMATE.start_main_~i2~84) 127) (<= (+ ~p2_new ~send2) 126) (<= (+ ~p3_new 1) ~alive3) (<= ~st1 ~id3) (<= ~id3 ~send3) (<= (+ ~alive3 ~alive2 256) 0) (<= (+ ~st1 1) ~mode2) (<= (+ ~nomsg 2) ~mode3) (<= ~st2 (+ ~nomsg 1)) (<= ~id2 ~send2) (<= 1 (+ ~send2 ~mode1)))) [2018-12-03 17:35:20,965 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 317) no Hoare annotation was computed. [2018-12-03 17:35:20,966 INFO L444 ceAbstractionStarter]: At program point L260(lines 253 261) the Hoare annotation is: (let ((.cse0 (+ ~p1_new ~id2)) (.cse1 (+ ~alive2 256)) (.cse2 (+ ~id2 ~id3))) (and (<= 0 (+ ~alive2 ~p3_new 257)) (<= (+ ~p1_new ~id3) 253) (= ~mode3 1) (<= 1 .cse0) (<= 0 (+ ~st3 ~nomsg 1)) (<= ~id2 (+ ~r1 127)) (<= 1 (+ ~p1_new ~send3)) (<= ~alive3 ULTIMATE.start_main_~i2~84) (<= .cse1 ~st2) (<= ULTIMATE.start_main_~i2~84 ~r1) (= ~mode1 1) (<= .cse0 253) (<= (+ ~p2_new 2) ~mode1) (<= 0 (+ ULTIMATE.start_main_~i2~84 ~st1)) (<= (* 2 ~p1_new) 254) (<= .cse2 253) (<= ~send2 ~id2) (<= ~nomsg ~p2_new) (<= ~send3 ~id3) (<= ~st3 .cse1) (<= ~r1 (+ ~p2_new 1)) (<= (+ ~send3 ULTIMATE.start_main_~i2~84) 127) (<= 0 (+ ~p1_new ~p3_new 1)) (<= (+ ~p3_new 1) ~alive3) (<= ~st1 ~id3) (<= ~id3 ~send3) (<= 1 .cse2) (<= (+ ~st1 1) ~mode2) (<= ~mode2 (+ ~alive2 257)) (<= ~st2 (+ ~nomsg 1)) (<= ~id2 ~send2) (<= 1 (+ ~send2 ~mode1)))) [2018-12-03 17:35:21,016 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:35:21 BoogieIcfgContainer [2018-12-03 17:35:21,016 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 17:35:21,017 INFO L168 Benchmark]: Toolchain (without parser) took 465669.37 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 306.2 MB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -307.7 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-12-03 17:35:21,018 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 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:35:21,019 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.56 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:35:21,019 INFO L168 Benchmark]: Boogie Preprocessor took 54.41 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:35:21,024 INFO L168 Benchmark]: RCFGBuilder took 630.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-12-03 17:35:21,025 INFO L168 Benchmark]: TraceAbstraction took 464926.01 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 306.2 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -350.0 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-12-03 17:35:21,033 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 53.56 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 54.41 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 630.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 464926.01 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 306.2 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -350.0 MB). 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: 317]: 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: 234]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((~p2_new + 1 <= main_~i2~84 && ~p1_new + ~id3 <= 253) && ~alive3 + ~mode2 <= 256) && 1 <= ~p1_new + ~id2) && ~id2 <= ~r1 + 127) && ~mode2 <= ~p3_new + 2) && 1 <= ~p1_new + ~send3) && ~p3_new + 1 <= ~st1) && 2 * ~st3 <= 0) && ~r1 <= ~alive2 + 256) && ~st1 <= main_~i2~84) && main_~i2~84 <= ~r1) && ~mode1 == 1) && ~p1_new + ~id2 <= 253) && 0 <= main_~i2~84 + ~st1) && 2 * ~p1_new <= 254) && ~st3 + ~mode3 + 256 <= 0) && ~id2 + ~id3 <= 253) && ~send2 <= ~id2) && ~send3 <= ~id3) && 0 <= ~st3 + ~st2) && ~r1 <= ~p2_new + 1) && ~alive2 + ~nomsg + 257 <= 0) && ~send3 + main_~i2~84 <= 127) && 0 <= ~p1_new + ~p3_new + 1) && ~p3_new + 1 <= ~alive3) && ~st1 <= ~id3) && ~id3 <= ~send3) && 1 <= ~id2 + ~id3) && ~st1 + 1 <= ~mode2) && ~st2 <= ~nomsg + 1) && ~id2 <= ~send2) && 1 <= ~send2 + ~mode1 - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((0 <= ~p1_new + ~st3 + 1 && 1 <= ~send3 + ~p1_old) && ~p3_old + 1 <= ~st2) && ~alive3 <= ~p3_old + 1) && 0 <= ~p1_old + ~p3_new + 1) && 1 <= ~send2 + ~id3) && ~mode2 <= ~p3_new + 2) && 2 * ~st3 <= 0) && ~p2_new <= ~p1_new) && ~p1_old + ~id3 <= 253) && main_~i2~84 <= ~r1) && main_~i2~84 + ~mode3 <= 1) && ~mode1 == 1) && 2 * ~p1_old <= 254) && 0 <= main_~i2~84 + ~st1) && ~id2 + ~id3 <= 253) && ~send2 <= ~id2) && ~send3 <= ~id3) && ~p1_new + 1 <= ~st1) && ~r1 <= ~p2_new + 1) && ~alive3 <= ~alive2 + 256) && ~send3 + main_~i2~84 <= 127) && ~p2_new + ~send2 <= 126) && ~p3_new + 1 <= ~alive3) && ~st1 <= ~id3) && ~id3 <= ~send3) && ~alive3 + ~alive2 + 256 <= 0) && ~st1 + 1 <= ~mode2) && ~nomsg + 2 <= ~mode3) && ~st2 <= ~nomsg + 1) && ~id2 <= ~send2) && 1 <= ~send2 + ~mode1 - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((1 <= ~p1_old + ~id3 && 0 <= ~p1_new + ~st3 + 1) && ~p3_old + 1 <= ~st2) && 1 <= ~st2 + check_~tmp~77) && ~alive3 <= ~p3_old + 1) && 0 <= ~p1_old + ~p3_new + 1) && ~mode2 <= ~p3_new + 2) && 2 * ~st3 <= 0) && ~p2_new <= ~p1_new) && ~r1 <= ~alive2 + 256) && main_~i2~84 <= ~r1) && main_~i2~84 + ~mode3 <= 1) && ~mode1 == 1) && check_~tmp~77 <= ~p1_new + 2) && 0 <= main_~i2~84 + ~st1) && ~id2 + ~id3 <= 253) && ~send2 <= ~id2) && ~send3 <= ~id3) && ~p1_new + ~mode2 <= 0) && ~p1_new + 1 <= ~st1) && ~r1 <= ~p2_new + 1) && ~alive2 + ~nomsg + 257 <= 0) && ~send2 + check_~tmp~77 <= 128) && ~send3 + main_~i2~84 <= 127) && ~p3_new + 1 <= ~alive3) && ~st1 <= ~id3) && ~id3 <= ~send3) && 1 <= ~id2 + ~id3) && ~st1 + 1 <= ~mode2) && ~nomsg + 2 <= ~mode3) && ~send3 + ~p1_old <= 253) && ~st2 <= ~nomsg + 1) && ~id2 <= ~send2) && ~p1_old <= ~st1 + 127) && 1 <= ~send2 + ~mode1 - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: ((((((((((((((((((~send2 <= ~id2 && 1 <= ~id2 + ~id3) && ~id2 <= ~send2) && ~id2 + ~id3 <= 253) && 0 <= ~alive2 + ~p3_new + 257) && main_~i2~84 <= ~r1) && ~mode1 <= ~alive3) && ~alive2 + 257 <= main_~i2~84) && ~r1 + ~send2 <= 128) && 0 <= ~st3 + ~mode1) && ~p3_new + 1 <= ~send2) || (((((((((((((~send2 <= ~id2 && ~p1_new + ~id2 <= 253) && 1 <= ~id2 + ~id3) && 1 <= ~p1_new + ~id2) && ~id2 <= ~send2) && ~id2 + ~id3 <= 253) && ~id2 <= ~r1 + 127) && ~r1 <= ~alive2 + 256) && main_~i2~84 <= ~r1) && ~mode1 == 1) && 0 <= main_~i2~84 + ~st1) && 0 <= ~p1_new + ~p3_new + 1) && 1 <= ~send2 + ~mode1) && ~r1 + ~alive2 + 1 <= 0)) && ((((((((((((((((((((((1 <= ~p1_new + ~send3 && ~p1_new + ~send3 <= 253) && ~r1 <= ~st1) && 0 <= ~p2_new + ~st2 + 1) && ~st3 + ~st1 <= 0) && ~mode3 + 256 <= ~st2) && ~alive3 <= ~st1 + 255) && ~p1_old <= ~p3_new) && 2 * ~p1_new <= 254) && 0 <= ~p1_old + ~mode2 + 1) && ~nomsg <= ~p2_new) && ~send3 <= ~id3) && ~send3 <= ~nomsg + 128) && ~mode2 <= ~r1) && ~st2 <= ~st3) && 0 <= ~p1_new + ~p3_new + 1) && ~st1 <= ~id3) && ~id3 <= ~send3) && ~p2_new + 1 == 0) && ~st2 <= ~nomsg + 1) && ~p1_old + 1 <= ~alive3) && ~p3_new + 1 == 0) || ((((((((((((((((((((!(~mode3 == 0) && ~alive3 <= ~p2_new + 1) && ~send3 + ~p1_old <= 253) && 0 <= ~p1_old + ~p3_new + 1) && ~alive3 + ~mode3 <= 1) && 2 * ~st3 <= 0) && 0 <= ~p1_new + ~p3_new + 2) && ~send3 <= ~id3) && ~send3 <= ~nomsg + 128) && ~p1_new + 1 <= ~st1) && ~mode2 <= ~r1) && ~r1 <= ~st2 + 1) && ~st2 <= ~st3) && ~p3_new + 1 <= ~alive3) && ~st1 <= ~id3) && ~id3 <= ~send3) && ~nomsg + 2 <= ~r1) && ~p2_new + 1 == 0) && ~st1 + 1 <= ~mode2) && ~st2 <= ~nomsg + 1) && ~p1_old <= ~st1 + 127))) && 2 <= 2 * assert_~arg) && main_~c1~84 == 1) && 2 * assert_#in~arg <= 2) && 2 * assert_~arg <= 2) && check_~tmp~77 == 1) && 2 <= 2 * assert_#in~arg) || (((((((((((((~send2 <= ~id2 && 1 <= ~id2 + ~id3) && ~id2 <= ~send2) && ~id2 + ~id3 <= 253) && 0 <= ~alive2 + ~p3_new + 257) && main_~i2~84 <= ~r1) && ~mode1 <= ~alive3) && ~alive2 + 257 <= main_~i2~84) && ~r1 + ~send2 <= 128) && 0 <= ~st3 + ~mode1) && ~p3_new + 1 <= ~send2) || (((((((((((((~send2 <= ~id2 && ~p1_new + ~id2 <= 253) && 1 <= ~id2 + ~id3) && 1 <= ~p1_new + ~id2) && ~id2 <= ~send2) && ~id2 + ~id3 <= 253) && ~id2 <= ~r1 + 127) && ~r1 <= ~alive2 + 256) && main_~i2~84 <= ~r1) && ~mode1 == 1) && 0 <= main_~i2~84 + ~st1) && 0 <= ~p1_new + ~p3_new + 1) && 1 <= ~send2 + ~mode1) && ~r1 + ~alive2 + 1 <= 0)) && ((((((((((((((((((((((1 <= ~p1_new + ~send3 && ~p1_new + ~send3 <= 253) && ~r1 <= ~st1) && 0 <= ~p2_new + ~st2 + 1) && ~st3 + ~st1 <= 0) && ~mode3 + 256 <= ~st2) && ~alive3 <= ~st1 + 255) && ~p1_old <= ~p3_new) && 2 * ~p1_new <= 254) && 0 <= ~p1_old + ~mode2 + 1) && ~nomsg <= ~p2_new) && ~send3 <= ~id3) && ~send3 <= ~nomsg + 128) && ~mode2 <= ~r1) && ~st2 <= ~st3) && 0 <= ~p1_new + ~p3_new + 1) && ~st1 <= ~id3) && ~id3 <= ~send3) && ~p2_new + 1 == 0) && ~st2 <= ~nomsg + 1) && ~p1_old + 1 <= ~alive3) && ~p3_new + 1 == 0) || ((((((((((((((((((((!(~mode3 == 0) && ~alive3 <= ~p2_new + 1) && ~send3 + ~p1_old <= 253) && 0 <= ~p1_old + ~p3_new + 1) && ~alive3 + ~mode3 <= 1) && 2 * ~st3 <= 0) && 0 <= ~p1_new + ~p3_new + 2) && ~send3 <= ~id3) && ~send3 <= ~nomsg + 128) && ~p1_new + 1 <= ~st1) && ~mode2 <= ~r1) && ~r1 <= ~st2 + 1) && ~st2 <= ~st3) && ~p3_new + 1 <= ~alive3) && ~st1 <= ~id3) && ~id3 <= ~send3) && ~nomsg + 2 <= ~r1) && ~p2_new + 1 == 0) && ~st1 + 1 <= ~mode2) && ~st2 <= ~nomsg + 1) && ~p1_old <= ~st1 + 127))) && 0 <= ~p1_new + ~p3_new + 1) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: (((((1 <= ~mode2 && ((assert_~arg == 1 && 2 * main_~c1~84 <= 2) && (((((((((~send2 <= ~id2 && 1 <= ~id2 + ~id3) && ~id2 <= ~send2) && ~id2 + ~id3 <= 253) && ~id2 <= ~r1 + 127) && ~r1 <= ~alive2 + 256) && ~p3_new + ~mode3 + 258 <= 0) && ~p3_new + 1 <= ~send2) && ~r1 + ~alive2 + 1 <= 0) || (((((((~send2 <= ~id2 && 1 <= ~id2 + ~id3) && ~id2 <= ~send2) && ~id2 + ~id3 <= 253) && ~id2 <= ~r1 + 127) && ~r1 <= ~alive2 + 256) && ~alive2 + ~nomsg + 257 <= 0) && 1 <= ~send2 + ~mode1))) && 2 <= 2 * main_~c1~84) && 2 * assert_#in~arg <= 2) && ((((((((((((((((((((((((~send3 <= ~id3 && ~id3 <= ~send3) && 1 <= ~send3 + ~p1_old) && ~p1_old + ~id3 <= 253) && main_~i2~84 + ~mode1 <= 2) && ~alive3 <= ~p3_old + 1) && ~mode2 <= ~p3_new + 2) && ~p1_new + 1 <= ~r1) && ~nomsg + 2 <= ~mode3) && main_~i2~84 + ~p1_old <= 128) && 0 <= ~p1_new + ~st3 + 1) && ~p3_old + 1 <= ~st2) && 0 <= ~p1_old + ~p3_new + 1) && ~alive3 + ~mode3 <= 1) && ~p2_new + 2 <= main_~i2~84) && 2 * ~st3 <= 0) && ~mode1 == 1) && ~id3 <= ~p3_old + 128) && ~p1_new + 1 <= ~st1) && ~r1 <= ~p2_new + 1) && ~p3_new + 1 <= ~alive3) && ~st1 <= ~id3) && ~st1 + 1 <= ~mode2) && ~st2 <= ~nomsg + 1) || ((((((((((((((((((((((~mode3 % 256 == 0 && ~send3 <= ~id3) && ~id3 <= ~send3) && ~p3_new + 1 <= ~st1) && 0 <= ~p1_new + ~mode2 + 1) && 0 <= ~p1_new + ~st3 + 1) && ~mode1 + 255 <= ~p3_new) && ~p3_old + 1 <= ~st2) && ~p2_new <= ~p1_new) && ~st1 <= main_~i2~84) && main_~i2~84 <= ~r1) && ~p3_new + ~mode3 + 258 <= 0) && ~nomsg <= ~p2_new) && 2 * ~r1 <= 0) && 0 <= ~p1_old + ~p3_old + 2) && ~p1_new + 1 <= ~st1) && ~send3 + main_~i2~84 <= 127) && ~alive3 + ~p3_old <= 254) && ~p3_new + 1 <= ~alive3) && ~st1 <= ~id3) && ~st3 <= ~mode1 + 256) && ~st2 <= ~nomsg + 1) && ~p1_old + ~mode2 + 1 <= 0))) && check_~tmp~77 == 1) && 2 <= 2 * assert_#in~arg) || (((((((((~send1 + ~send3 <= 253 && 1 <= ~send1 + ~id2) && ~send1 + ~send2 <= 253) && 1 <= ~send1 + ~id3) && 0 <= ~send1 + ~st1) && main_~i2~84 + 256 <= ~alive1) && ~send1 + ~mode1 + 129 <= 0) && ~alive1 + ~p3_new <= 510) && (((((((((~send2 <= ~id2 && 1 <= ~id2 + ~id3) && ~id2 <= ~send2) && ~id2 + ~id3 <= 253) && ~id2 <= ~r1 + 127) && ~r1 <= ~alive2 + 256) && ~p3_new + ~mode3 + 258 <= 0) && ~p3_new + 1 <= ~send2) && ~r1 + ~alive2 + 1 <= 0) || (((((((~send2 <= ~id2 && 1 <= ~id2 + ~id3) && ~id2 <= ~send2) && ~id2 + ~id3 <= 253) && ~id2 <= ~r1 + 127) && ~r1 <= ~alive2 + 256) && ~alive2 + ~nomsg + 257 <= 0) && 1 <= ~send2 + ~mode1))) && ((((((((((((((((((((((((~send3 <= ~id3 && ~id3 <= ~send3) && 1 <= ~send3 + ~p1_old) && ~p1_old + ~id3 <= 253) && main_~i2~84 + ~mode1 <= 2) && ~alive3 <= ~p3_old + 1) && ~mode2 <= ~p3_new + 2) && ~p1_new + 1 <= ~r1) && ~nomsg + 2 <= ~mode3) && main_~i2~84 + ~p1_old <= 128) && 0 <= ~p1_new + ~st3 + 1) && ~p3_old + 1 <= ~st2) && 0 <= ~p1_old + ~p3_new + 1) && ~alive3 + ~mode3 <= 1) && ~p2_new + 2 <= main_~i2~84) && 2 * ~st3 <= 0) && ~mode1 == 1) && ~id3 <= ~p3_old + 128) && ~p1_new + 1 <= ~st1) && ~r1 <= ~p2_new + 1) && ~p3_new + 1 <= ~alive3) && ~st1 <= ~id3) && ~st1 + 1 <= ~mode2) && ~st2 <= ~nomsg + 1) || ((((((((((((((((((((((~mode3 % 256 == 0 && ~send3 <= ~id3) && ~id3 <= ~send3) && ~p3_new + 1 <= ~st1) && 0 <= ~p1_new + ~mode2 + 1) && 0 <= ~p1_new + ~st3 + 1) && ~mode1 + 255 <= ~p3_new) && ~p3_old + 1 <= ~st2) && ~p2_new <= ~p1_new) && ~st1 <= main_~i2~84) && main_~i2~84 <= ~r1) && ~p3_new + ~mode3 + 258 <= 0) && ~nomsg <= ~p2_new) && 2 * ~r1 <= 0) && 0 <= ~p1_old + ~p3_old + 2) && ~p1_new + 1 <= ~st1) && ~send3 + main_~i2~84 <= 127) && ~alive3 + ~p3_old <= 254) && ~p3_new + 1 <= ~alive3) && ~st1 <= ~id3) && ~st3 <= ~mode1 + 256) && ~st2 <= ~nomsg + 1) && ~p1_old + ~mode2 + 1 <= 0))) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 245]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((~p2_new + 1 <= main_~i2~84 && ~p1_new + ~id3 <= 253) && ~alive3 + ~mode2 <= 256) && 1 <= ~p1_new + ~id2) && ~id2 <= ~r1 + 127) && ~mode2 <= ~p3_new + 2) && 1 <= ~p1_new + ~send3) && ~p3_new + 1 <= ~st1) && 2 * ~st3 <= 0) && ~r1 <= ~alive2 + 256) && ~st1 <= main_~i2~84) && main_~i2~84 <= ~r1) && ~mode1 == 1) && ~p1_new + ~id2 <= 253) && 0 <= main_~i2~84 + ~st1) && 2 * ~p1_new <= 254) && ~st3 + ~mode3 + 256 <= 0) && ~id2 + ~id3 <= 253) && ~send2 <= ~id2) && ~send3 <= ~id3) && 0 <= ~st3 + ~st2) && ~r1 <= ~p2_new + 1) && ~alive2 + ~nomsg + 257 <= 0) && ~send3 + main_~i2~84 <= 127) && 0 <= ~p1_new + ~p3_new + 1) && ~p3_new + 1 <= ~alive3) && ~st1 <= ~id3) && ~id3 <= ~send3) && 1 <= ~id2 + ~id3) && ~st1 + 1 <= ~mode2) && ~st2 <= ~nomsg + 1) && ~id2 <= ~send2) && 1 <= ~send2 + ~mode1 - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: ((((((((((((((((((~send2 <= ~id2 && 1 <= ~id2 + ~id3) && ~id2 <= ~send2) && ~id2 + ~id3 <= 253) && 0 <= ~alive2 + ~p3_new + 257) && main_~i2~84 <= ~r1) && ~mode1 <= ~alive3) && ~alive2 + 257 <= main_~i2~84) && ~r1 + ~send2 <= 128) && 0 <= ~st3 + ~mode1) && ~p3_new + 1 <= ~send2) || (((((((((((((~send2 <= ~id2 && ~p1_new + ~id2 <= 253) && 1 <= ~id2 + ~id3) && 1 <= ~p1_new + ~id2) && ~id2 <= ~send2) && ~id2 + ~id3 <= 253) && ~id2 <= ~r1 + 127) && ~r1 <= ~alive2 + 256) && main_~i2~84 <= ~r1) && ~mode1 == 1) && 0 <= main_~i2~84 + ~st1) && 0 <= ~p1_new + ~p3_new + 1) && 1 <= ~send2 + ~mode1) && ~r1 + ~alive2 + 1 <= 0)) && ((((((((((((((((((((((1 <= ~p1_new + ~send3 && ~p1_new + ~send3 <= 253) && ~r1 <= ~st1) && 0 <= ~p2_new + ~st2 + 1) && ~st3 + ~st1 <= 0) && ~mode3 + 256 <= ~st2) && ~alive3 <= ~st1 + 255) && ~p1_old <= ~p3_new) && 2 * ~p1_new <= 254) && 0 <= ~p1_old + ~mode2 + 1) && ~nomsg <= ~p2_new) && ~send3 <= ~id3) && ~send3 <= ~nomsg + 128) && ~mode2 <= ~r1) && ~st2 <= ~st3) && 0 <= ~p1_new + ~p3_new + 1) && ~st1 <= ~id3) && ~id3 <= ~send3) && ~p2_new + 1 == 0) && ~st2 <= ~nomsg + 1) && ~p1_old + 1 <= ~alive3) && ~p3_new + 1 == 0) || ((((((((((((((((((((!(~mode3 == 0) && ~alive3 <= ~p2_new + 1) && ~send3 + ~p1_old <= 253) && 0 <= ~p1_old + ~p3_new + 1) && ~alive3 + ~mode3 <= 1) && 2 * ~st3 <= 0) && 0 <= ~p1_new + ~p3_new + 2) && ~send3 <= ~id3) && ~send3 <= ~nomsg + 128) && ~p1_new + 1 <= ~st1) && ~mode2 <= ~r1) && ~r1 <= ~st2 + 1) && ~st2 <= ~st3) && ~p3_new + 1 <= ~alive3) && ~st1 <= ~id3) && ~id3 <= ~send3) && ~nomsg + 2 <= ~r1) && ~p2_new + 1 == 0) && ~st1 + 1 <= ~mode2) && ~st2 <= ~nomsg + 1) && ~p1_old <= ~st1 + 127))) && 2 <= 2 * assert_~arg) && main_~c1~84 == 1) && 2 * assert_#in~arg <= 2) && 2 * assert_~arg <= 2) && check_~tmp~77 == 1) && 2 <= 2 * assert_#in~arg) || (((((((((((((~send2 <= ~id2 && 1 <= ~id2 + ~id3) && ~id2 <= ~send2) && ~id2 + ~id3 <= 253) && 0 <= ~alive2 + ~p3_new + 257) && main_~i2~84 <= ~r1) && ~mode1 <= ~alive3) && ~alive2 + 257 <= main_~i2~84) && ~r1 + ~send2 <= 128) && 0 <= ~st3 + ~mode1) && ~p3_new + 1 <= ~send2) || (((((((((((((~send2 <= ~id2 && ~p1_new + ~id2 <= 253) && 1 <= ~id2 + ~id3) && 1 <= ~p1_new + ~id2) && ~id2 <= ~send2) && ~id2 + ~id3 <= 253) && ~id2 <= ~r1 + 127) && ~r1 <= ~alive2 + 256) && main_~i2~84 <= ~r1) && ~mode1 == 1) && 0 <= main_~i2~84 + ~st1) && 0 <= ~p1_new + ~p3_new + 1) && 1 <= ~send2 + ~mode1) && ~r1 + ~alive2 + 1 <= 0)) && ((((((((((((((((((((((1 <= ~p1_new + ~send3 && ~p1_new + ~send3 <= 253) && ~r1 <= ~st1) && 0 <= ~p2_new + ~st2 + 1) && ~st3 + ~st1 <= 0) && ~mode3 + 256 <= ~st2) && ~alive3 <= ~st1 + 255) && ~p1_old <= ~p3_new) && 2 * ~p1_new <= 254) && 0 <= ~p1_old + ~mode2 + 1) && ~nomsg <= ~p2_new) && ~send3 <= ~id3) && ~send3 <= ~nomsg + 128) && ~mode2 <= ~r1) && ~st2 <= ~st3) && 0 <= ~p1_new + ~p3_new + 1) && ~st1 <= ~id3) && ~id3 <= ~send3) && ~p2_new + 1 == 0) && ~st2 <= ~nomsg + 1) && ~p1_old + 1 <= ~alive3) && ~p3_new + 1 == 0) || ((((((((((((((((((((!(~mode3 == 0) && ~alive3 <= ~p2_new + 1) && ~send3 + ~p1_old <= 253) && 0 <= ~p1_old + ~p3_new + 1) && ~alive3 + ~mode3 <= 1) && 2 * ~st3 <= 0) && 0 <= ~p1_new + ~p3_new + 2) && ~send3 <= ~id3) && ~send3 <= ~nomsg + 128) && ~p1_new + 1 <= ~st1) && ~mode2 <= ~r1) && ~r1 <= ~st2 + 1) && ~st2 <= ~st3) && ~p3_new + 1 <= ~alive3) && ~st1 <= ~id3) && ~id3 <= ~send3) && ~nomsg + 2 <= ~r1) && ~p2_new + 1 == 0) && ~st1 + 1 <= ~mode2) && ~st2 <= ~nomsg + 1) && ~p1_old <= ~st1 + 127))) && 0 <= ~p1_new + ~p3_new + 1) - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((assert_#in~arg <= ~p3_old + 2 && 1 <= ~send3 + ~p1_old) && ~p3_old + 1 <= ~st2) && 1 <= ~st2 + check_~tmp~77) && 0 <= ~p1_old + ~p3_new + 1) && ~alive3 + ~mode3 <= 1) && ~mode2 <= ~p3_new + 2) && 2 * ~st3 <= 0) && 1 <= ~st3 + main_~c1~84) && ~p1_old + ~id3 <= 253) && ~r1 <= ~alive2 + 256) && main_~i2~84 + ~mode3 <= 1) && ~mode1 == 1) && check_~tmp~77 <= ~p1_new + 2) && 0 <= main_~i2~84 + ~st1) && ~id2 + ~id3 <= 253) && ~send2 <= ~id2) && ~nomsg <= ~p2_new) && ~send3 <= ~id3) && assert_#in~arg <= ~r1 + 1) && ~p1_new + ~mode2 <= 0) && ~p1_new + 1 <= ~st1) && ~alive2 + ~nomsg + 257 <= 0) && ~send2 + check_~tmp~77 <= 128) && ~send3 + main_~i2~84 <= 127) && ~p2_new + 2 <= assert_#in~arg) && ~p3_new + 1 <= ~alive3) && ~st1 <= ~id3) && ~id3 <= ~send3) && 1 <= ~id2 + ~id3) && main_~c1~84 + ~st2 <= 1) && ~st1 + 1 <= ~mode2) && ~nomsg + 2 <= ~mode3) && main_~c1~84 + ~p1_old <= 128) && ~st2 <= ~nomsg + 1) && ~id2 <= ~send2) && 1 <= ~send2 + ~mode1 - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((0 <= ~alive2 + ~p3_new + 257 && 1 <= ~send3 + ~p1_old) && ~p3_old + 1 <= ~st2) && 1 <= ~st2 + check_~tmp~77) && 0 <= ~p1_old + ~p3_new + 1) && ~alive3 + ~mode3 <= 1) && 0 <= ~alive2 + ~p3_old + 257) && 2 * ~st3 <= 0) && 1 <= ~st3 + main_~c1~84) && ~p2_new <= ~p1_new) && ~p1_old + ~id3 <= 253) && main_~i2~84 <= ~r1) && ~mode1 == 1) && check_~tmp~77 <= ~p1_new + 2) && 0 <= main_~i2~84 + ~st1) && ~id2 + ~id3 <= 253) && ~send2 <= ~id2) && ~send3 <= ~id3) && ~p1_new + ~mode2 <= 0) && ~p1_new + 1 <= ~st1) && ~r1 <= ~p2_new + 1) && ~alive2 + ~nomsg + 257 <= 0) && ~send2 + check_~tmp~77 <= 128) && ~send3 + main_~i2~84 <= 127) && ~p3_new + 1 <= ~alive3) && ~st1 <= ~id3) && ~id3 <= ~send3) && 1 <= ~id2 + ~id3) && ~st1 + 1 <= ~mode2) && main_~c1~84 + ~st2 <= 1) && ~nomsg + 2 <= ~mode3) && main_~c1~84 + ~p1_old <= 128) && ~st2 <= ~nomsg + 1) && ~id2 <= ~send2) && 1 <= ~send2 + ~mode1 - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((1 <= ~mode2 && ((assert_~arg == 1 && 2 * main_~c1~84 <= 2) && (((((((((~send2 <= ~id2 && 1 <= ~id2 + ~id3) && ~id2 <= ~send2) && ~id2 + ~id3 <= 253) && ~id2 <= ~r1 + 127) && ~r1 <= ~alive2 + 256) && ~p3_new + ~mode3 + 258 <= 0) && ~p3_new + 1 <= ~send2) && ~r1 + ~alive2 + 1 <= 0) || (((((((~send2 <= ~id2 && 1 <= ~id2 + ~id3) && ~id2 <= ~send2) && ~id2 + ~id3 <= 253) && ~id2 <= ~r1 + 127) && ~r1 <= ~alive2 + 256) && ~alive2 + ~nomsg + 257 <= 0) && 1 <= ~send2 + ~mode1))) && 2 <= 2 * main_~c1~84) && 2 * assert_#in~arg <= 2) && ((((((((((((((((((((((((~send3 <= ~id3 && ~id3 <= ~send3) && 1 <= ~send3 + ~p1_old) && ~p1_old + ~id3 <= 253) && main_~i2~84 + ~mode1 <= 2) && ~alive3 <= ~p3_old + 1) && ~mode2 <= ~p3_new + 2) && ~p1_new + 1 <= ~r1) && ~nomsg + 2 <= ~mode3) && main_~i2~84 + ~p1_old <= 128) && 0 <= ~p1_new + ~st3 + 1) && ~p3_old + 1 <= ~st2) && 0 <= ~p1_old + ~p3_new + 1) && ~alive3 + ~mode3 <= 1) && ~p2_new + 2 <= main_~i2~84) && 2 * ~st3 <= 0) && ~mode1 == 1) && ~id3 <= ~p3_old + 128) && ~p1_new + 1 <= ~st1) && ~r1 <= ~p2_new + 1) && ~p3_new + 1 <= ~alive3) && ~st1 <= ~id3) && ~st1 + 1 <= ~mode2) && ~st2 <= ~nomsg + 1) || ((((((((((((((((((((((~mode3 % 256 == 0 && ~send3 <= ~id3) && ~id3 <= ~send3) && ~p3_new + 1 <= ~st1) && 0 <= ~p1_new + ~mode2 + 1) && 0 <= ~p1_new + ~st3 + 1) && ~mode1 + 255 <= ~p3_new) && ~p3_old + 1 <= ~st2) && ~p2_new <= ~p1_new) && ~st1 <= main_~i2~84) && main_~i2~84 <= ~r1) && ~p3_new + ~mode3 + 258 <= 0) && ~nomsg <= ~p2_new) && 2 * ~r1 <= 0) && 0 <= ~p1_old + ~p3_old + 2) && ~p1_new + 1 <= ~st1) && ~send3 + main_~i2~84 <= 127) && ~alive3 + ~p3_old <= 254) && ~p3_new + 1 <= ~alive3) && ~st1 <= ~id3) && ~st3 <= ~mode1 + 256) && ~st2 <= ~nomsg + 1) && ~p1_old + ~mode2 + 1 <= 0))) && check_~tmp~77 == 1) && 2 <= 2 * assert_#in~arg) || (((((((((~send1 + ~send3 <= 253 && 1 <= ~send1 + ~id2) && ~send1 + ~send2 <= 253) && 1 <= ~send1 + ~id3) && 0 <= ~send1 + ~st1) && main_~i2~84 + 256 <= ~alive1) && ~send1 + ~mode1 + 129 <= 0) && ~alive1 + ~p3_new <= 510) && (((((((((~send2 <= ~id2 && 1 <= ~id2 + ~id3) && ~id2 <= ~send2) && ~id2 + ~id3 <= 253) && ~id2 <= ~r1 + 127) && ~r1 <= ~alive2 + 256) && ~p3_new + ~mode3 + 258 <= 0) && ~p3_new + 1 <= ~send2) && ~r1 + ~alive2 + 1 <= 0) || (((((((~send2 <= ~id2 && 1 <= ~id2 + ~id3) && ~id2 <= ~send2) && ~id2 + ~id3 <= 253) && ~id2 <= ~r1 + 127) && ~r1 <= ~alive2 + 256) && ~alive2 + ~nomsg + 257 <= 0) && 1 <= ~send2 + ~mode1))) && ((((((((((((((((((((((((~send3 <= ~id3 && ~id3 <= ~send3) && 1 <= ~send3 + ~p1_old) && ~p1_old + ~id3 <= 253) && main_~i2~84 + ~mode1 <= 2) && ~alive3 <= ~p3_old + 1) && ~mode2 <= ~p3_new + 2) && ~p1_new + 1 <= ~r1) && ~nomsg + 2 <= ~mode3) && main_~i2~84 + ~p1_old <= 128) && 0 <= ~p1_new + ~st3 + 1) && ~p3_old + 1 <= ~st2) && 0 <= ~p1_old + ~p3_new + 1) && ~alive3 + ~mode3 <= 1) && ~p2_new + 2 <= main_~i2~84) && 2 * ~st3 <= 0) && ~mode1 == 1) && ~id3 <= ~p3_old + 128) && ~p1_new + 1 <= ~st1) && ~r1 <= ~p2_new + 1) && ~p3_new + 1 <= ~alive3) && ~st1 <= ~id3) && ~st1 + 1 <= ~mode2) && ~st2 <= ~nomsg + 1) || ((((((((((((((((((((((~mode3 % 256 == 0 && ~send3 <= ~id3) && ~id3 <= ~send3) && ~p3_new + 1 <= ~st1) && 0 <= ~p1_new + ~mode2 + 1) && 0 <= ~p1_new + ~st3 + 1) && ~mode1 + 255 <= ~p3_new) && ~p3_old + 1 <= ~st2) && ~p2_new <= ~p1_new) && ~st1 <= main_~i2~84) && main_~i2~84 <= ~r1) && ~p3_new + ~mode3 + 258 <= 0) && ~nomsg <= ~p2_new) && 2 * ~r1 <= 0) && 0 <= ~p1_old + ~p3_old + 2) && ~p1_new + 1 <= ~st1) && ~send3 + main_~i2~84 <= 127) && ~alive3 + ~p3_old <= 254) && ~p3_new + 1 <= ~alive3) && ~st1 <= ~id3) && ~st3 <= ~mode1 + 256) && ~st2 <= ~nomsg + 1) && ~p1_old + ~mode2 + 1 <= 0))) - InvariantResult [Line: 304]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((2 <= ~mode1 + ~mode3 && assert_#in~arg <= ~p3_old + 2) && 0 <= ~p1_new + ~st3 + 1) && 1 <= ~send3 + ~p1_old) && ~p1_new + assert_~arg <= 0) && 1 <= ~st2 + check_~tmp~77) && ~id2 <= ~r1 + 127) && 0 <= ~p1_old + ~p3_new + 1) && ~alive3 + ~mode3 <= 1) && ~mode2 <= ~p3_new + 2) && ~p3_new + 1 <= ~st1) && ~p1_old + ~id3 <= 253) && ~p3_old + 2 <= assert_~arg) && main_~c1~84 <= ~mode1) && main_~i2~84 + ~mode3 <= 1) && ~mode1 == 1) && 2 * ~p1_old <= 254) && ~nomsg + ~p3_old + 2 <= 0) && check_~tmp~77 <= ~p1_new + 2) && ~mode2 <= main_~c1~84) && 0 <= main_~i2~84 + ~st1) && ~id2 + ~id3 <= 253) && ~send2 <= ~id2) && ~send3 <= ~id3) && 2 * ~r1 <= 0) && 0 <= ~alive2 + ~nomsg + 257) && ~send3 + main_~i2~84 <= 127) && ~p2_new + 2 <= assert_#in~arg) && 1 <= assert_~arg + ~id3) && ~id3 <= ~send3) && 1 <= ~id2 + ~id3) && 0 <= ~p2_new + ~st2 + 1) && ~st1 + 1 <= ~mode2) && ~p1_new + 1 <= ~r1) && assert_#in~arg + ~alive2 + 255 <= 0) && ~st3 + ~st2 <= 0) && assert_#in~arg <= ~alive3 + 1) && ~id2 <= ~send2) && 1 <= ~send2 + ~mode1 - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((0 <= ~alive2 + ~p3_new + 257 && ~p1_new + ~id3 <= 253) && ~mode3 == 1) && 1 <= ~p1_new + ~id2) && 0 <= ~st3 + ~nomsg + 1) && ~id2 <= ~r1 + 127) && 1 <= ~p1_new + ~send3) && ~alive3 <= main_~i2~84) && ~alive2 + 256 <= ~st2) && main_~i2~84 <= ~r1) && ~mode1 == 1) && ~p1_new + ~id2 <= 253) && ~p2_new + 2 <= ~mode1) && 0 <= main_~i2~84 + ~st1) && 2 * ~p1_new <= 254) && ~id2 + ~id3 <= 253) && ~send2 <= ~id2) && ~nomsg <= ~p2_new) && ~send3 <= ~id3) && ~st3 <= ~alive2 + 256) && ~r1 <= ~p2_new + 1) && ~send3 + main_~i2~84 <= 127) && 0 <= ~p1_new + ~p3_new + 1) && ~p3_new + 1 <= ~alive3) && ~st1 <= ~id3) && ~id3 <= ~send3) && 1 <= ~id2 + ~id3) && ~st1 + 1 <= ~mode2) && ~mode2 <= ~alive2 + 257) && ~st2 <= ~nomsg + 1) && ~id2 <= ~send2) && 1 <= ~send2 + ~mode1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 464.8s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 37.0s AutomataDifference, 0.0s DeadEndRemovalTime, 405.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 185 SDtfs, 500 SDslu, 293 SDs, 0 SdLazy, 478 SolverSat, 160 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.9s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 287 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 22.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.7s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.9790126359094917 AbsIntWeakeningRatio, 1.74 AbsIntAvgWeakeningVarsNumRemoved, 1078.06 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 9 MinimizatonAttempts, 157 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 29 NumberOfFragments, 3983 HoareAnnotationTreeSize, 13 FomulaSimplifications, 61442 FormulaSimplificationTreeSizeReduction, 46.6s HoareSimplificationTime, 13 FomulaSimplificationsInter, 150437 FormulaSimplificationTreeSizeReductionInter, 358.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 322 NumberOfCodeBlocks, 310 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 397 ConstructedInterpolants, 0 QuantifiedInterpolants, 27068 SizeOfPredicates, 0 NumberOfNonLiveVariables, 595 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 376/384 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...