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/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:54:20,439 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:54:20,441 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:54:20,453 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:54:20,453 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:54:20,454 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:54:20,456 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:54:20,457 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:54:20,459 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:54:20,460 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:54:20,460 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:54:20,461 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:54:20,462 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:54:20,463 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:54:20,464 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:54:20,465 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:54:20,465 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:54:20,467 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:54:20,469 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:54:20,471 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:54:20,472 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:54:20,473 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:54:20,475 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:54:20,475 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:54:20,476 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:54:20,476 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:54:20,477 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:54:20,478 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:54:20,479 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:54:20,480 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:54:20,480 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:54:20,481 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:54:20,481 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:54:20,481 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:54:20,482 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:54:20,483 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:54:20,483 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:54:20,497 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:54:20,498 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:54:20,498 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:54:20,500 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:54:20,500 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:54:20,500 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:54:20,500 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:54:20,501 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:54:20,501 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:54:20,501 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:54:20,501 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:54:20,501 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:54:20,504 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:54:20,505 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:54:20,505 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:54:20,505 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:54:20,505 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:54:20,505 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:54:20,506 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:54:20,506 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:54:20,506 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:54:20,506 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:54:20,506 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:54:20,508 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:54:20,508 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:54:20,508 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:54:20,509 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:54:20,509 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:54:20,509 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:54:20,509 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:54:20,510 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:54:20,510 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:54:20,510 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:54:20,510 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:54:20,510 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:54:20,511 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:54:20,511 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:54:20,511 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:54:20,511 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:54:20,565 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:54:20,580 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:54:20,586 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:54:20,588 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:54:20,589 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:54:20,590 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl [2018-12-03 17:54:20,590 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl' [2018-12-03 17:54:20,668 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:54:20,669 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:54:20,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:54:20,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:54:20,670 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:54:20,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:54:20" (1/1) ... [2018-12-03 17:54:20,701 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:54:20" (1/1) ... [2018-12-03 17:54:20,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:54:20,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:54:20,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:54:20,711 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:54:20,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:54:20" (1/1) ... [2018-12-03 17:54:20,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:54:20" (1/1) ... [2018-12-03 17:54:20,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:54:20" (1/1) ... [2018-12-03 17:54:20,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:54:20" (1/1) ... [2018-12-03 17:54:20,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:54:20" (1/1) ... [2018-12-03 17:54:20,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:54:20" (1/1) ... [2018-12-03 17:54:20,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:54:20" (1/1) ... [2018-12-03 17:54:20,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:54:20,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:54:20,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:54:20,746 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:54:20,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:54:20" (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:54:20,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:54:20,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:54:21,387 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:54:21,388 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 17:54:21,388 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:54:21 BoogieIcfgContainer [2018-12-03 17:54:21,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:54:21,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:54:21,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:54:21,393 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:54:21,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:54:20" (1/2) ... [2018-12-03 17:54:21,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7309cc5b and model type pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:54:21, skipping insertion in model container [2018-12-03 17:54:21,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:54:21" (2/2) ... [2018-12-03 17:54:21,397 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl [2018-12-03 17:54:21,407 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:54:21,417 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:54:21,435 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:54:21,481 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:54:21,481 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:54:21,481 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:54:21,482 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:54:21,482 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:54:21,482 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:54:21,482 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:54:21,482 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:54:21,504 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-12-03 17:54:21,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:54:21,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:21,522 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:54:21,525 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:21,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:21,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027031, now seen corresponding path program 1 times [2018-12-03 17:54:21,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:21,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:21,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:21,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:21,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:21,786 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:54:21,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:54:21,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:54:21,789 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:54:21,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:54:21,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:54:21,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:21,811 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-12-03 17:54:21,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:21,876 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2018-12-03 17:54:21,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:54:21,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 17:54:21,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:21,891 INFO L225 Difference]: With dead ends: 45 [2018-12-03 17:54:21,891 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 17:54:21,897 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:54:21,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 17:54:21,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-12-03 17:54:21,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 17:54:21,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-03 17:54:21,939 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2018-12-03 17:54:21,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:21,940 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-03 17:54:21,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:54:21,940 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-03 17:54:21,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:54:21,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:21,941 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:54:21,941 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:21,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:21,942 INFO L82 PathProgramCache]: Analyzing trace with hash 2081192469, now seen corresponding path program 1 times [2018-12-03 17:54:21,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:21,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:21,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:21,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:21,945 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:22,052 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:54:22,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:54:22,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:54:22,053 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:54:22,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:54:22,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:54:22,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:22,056 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 3 states. [2018-12-03 17:54:22,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:22,112 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2018-12-03 17:54:22,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:54:22,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 17:54:22,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:22,122 INFO L225 Difference]: With dead ends: 79 [2018-12-03 17:54:22,122 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 17:54:22,123 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:54:22,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 17:54:22,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-12-03 17:54:22,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 17:54:22,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2018-12-03 17:54:22,141 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 14 [2018-12-03 17:54:22,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:22,141 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2018-12-03 17:54:22,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:54:22,141 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2018-12-03 17:54:22,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:54:22,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:22,143 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:54:22,143 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:22,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:22,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1271845843, now seen corresponding path program 1 times [2018-12-03 17:54:22,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:22,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:22,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:22,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:22,148 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:22,375 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:54:22,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:54:22,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:54:22,376 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:54:22,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:54:22,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:54:22,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:54:22,380 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand 4 states. [2018-12-03 17:54:22,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:22,687 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2018-12-03 17:54:22,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:54:22,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-03 17:54:22,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:22,694 INFO L225 Difference]: With dead ends: 109 [2018-12-03 17:54:22,694 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 17:54:22,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:54:22,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 17:54:22,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 59. [2018-12-03 17:54:22,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 17:54:22,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2018-12-03 17:54:22,738 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 14 [2018-12-03 17:54:22,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:22,738 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2018-12-03 17:54:22,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:54:22,742 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2018-12-03 17:54:22,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:54:22,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:22,743 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:54:22,744 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:22,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:22,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1271905425, now seen corresponding path program 1 times [2018-12-03 17:54:22,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:22,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:22,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:22,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:22,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:22,864 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:54:22,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:54:22,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:54:22,865 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:54:22,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:54:22,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:54:22,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:22,866 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand 3 states. [2018-12-03 17:54:22,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:22,925 INFO L93 Difference]: Finished difference Result 143 states and 190 transitions. [2018-12-03 17:54:22,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:54:22,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 17:54:22,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:22,931 INFO L225 Difference]: With dead ends: 143 [2018-12-03 17:54:22,931 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 17:54:22,932 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:54:22,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 17:54:22,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 17:54:22,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 17:54:22,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2018-12-03 17:54:22,969 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 14 [2018-12-03 17:54:22,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:22,969 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2018-12-03 17:54:22,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:54:22,970 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2018-12-03 17:54:22,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 17:54:22,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:22,972 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:54:22,972 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:22,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:22,972 INFO L82 PathProgramCache]: Analyzing trace with hash -602166477, now seen corresponding path program 1 times [2018-12-03 17:54:22,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:22,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:22,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:22,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:22,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:23,128 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:54:23,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:54:23,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:54:23,129 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:54:23,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:54:23,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:54:23,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:23,131 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand 3 states. [2018-12-03 17:54:23,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:23,188 INFO L93 Difference]: Finished difference Result 249 states and 327 transitions. [2018-12-03 17:54:23,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:54:23,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-03 17:54:23,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:23,190 INFO L225 Difference]: With dead ends: 249 [2018-12-03 17:54:23,190 INFO L226 Difference]: Without dead ends: 167 [2018-12-03 17:54:23,191 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:54:23,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-03 17:54:23,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-12-03 17:54:23,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 17:54:23,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 212 transitions. [2018-12-03 17:54:23,232 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 212 transitions. Word has length 26 [2018-12-03 17:54:23,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:23,233 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 212 transitions. [2018-12-03 17:54:23,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:54:23,233 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 212 transitions. [2018-12-03 17:54:23,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 17:54:23,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:23,235 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:54:23,236 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:23,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:23,236 INFO L82 PathProgramCache]: Analyzing trace with hash -209139467, now seen corresponding path program 1 times [2018-12-03 17:54:23,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:23,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:23,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:23,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:23,240 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:23,587 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 17:54:23,590 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:54:23,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:54:23,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:54:23,592 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:54:23,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:54:23,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:54:23,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:23,594 INFO L87 Difference]: Start difference. First operand 165 states and 212 transitions. Second operand 3 states. [2018-12-03 17:54:23,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:23,719 INFO L93 Difference]: Finished difference Result 489 states and 630 transitions. [2018-12-03 17:54:23,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:54:23,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-03 17:54:23,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:23,722 INFO L225 Difference]: With dead ends: 489 [2018-12-03 17:54:23,722 INFO L226 Difference]: Without dead ends: 327 [2018-12-03 17:54:23,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:23,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-03 17:54:23,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2018-12-03 17:54:23,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-12-03 17:54:23,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 408 transitions. [2018-12-03 17:54:23,806 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 408 transitions. Word has length 26 [2018-12-03 17:54:23,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:23,809 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 408 transitions. [2018-12-03 17:54:23,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:54:23,810 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 408 transitions. [2018-12-03 17:54:23,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 17:54:23,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:23,816 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:54:23,817 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:23,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:23,817 INFO L82 PathProgramCache]: Analyzing trace with hash -266397769, now seen corresponding path program 1 times [2018-12-03 17:54:23,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:23,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:23,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:23,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:23,820 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:24,030 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:54:24,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:54:24,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:54:24,032 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-03 17:54:24,034 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50] [2018-12-03 17:54:24,099 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:54:24,099 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:54:25,135 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 17:54:43,292 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:54:43,293 INFO L272 AbstractInterpreter]: Visited 20 different actions 160 times. Merged at 19 different actions 108 times. Widened at 4 different actions 4 times. Found 31 fixpoints after 11 different actions. Largest state had 0 variables. [2018-12-03 17:54:43,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:43,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:54:43,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:54:43,307 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:54:43,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:43,322 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:54:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:43,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:54:43,533 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:54:43,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:54:43,825 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:54:43,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:54:43,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2018-12-03 17:54:43,862 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:54:43,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:54:43,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:54:43,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:54:43,863 INFO L87 Difference]: Start difference. First operand 325 states and 408 transitions. Second operand 7 states. [2018-12-03 17:54:44,377 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 17:54:45,553 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 17:54:45,795 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 17:54:45,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:45,911 INFO L93 Difference]: Finished difference Result 911 states and 1139 transitions. [2018-12-03 17:54:45,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:54:45,912 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-03 17:54:45,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:45,915 INFO L225 Difference]: With dead ends: 911 [2018-12-03 17:54:45,915 INFO L226 Difference]: Without dead ends: 589 [2018-12-03 17:54:45,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:54:45,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-12-03 17:54:46,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 409. [2018-12-03 17:54:46,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-12-03 17:54:46,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 505 transitions. [2018-12-03 17:54:46,017 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 505 transitions. Word has length 26 [2018-12-03 17:54:46,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:46,017 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 505 transitions. [2018-12-03 17:54:46,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:54:46,018 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 505 transitions. [2018-12-03 17:54:46,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 17:54:46,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:46,020 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:54:46,020 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:46,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:46,021 INFO L82 PathProgramCache]: Analyzing trace with hash 819979193, now seen corresponding path program 2 times [2018-12-03 17:54:46,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:46,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:46,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:46,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:46,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-03 17:54:46,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:54:46,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:54:46,179 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:54:46,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:54:46,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:54:46,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:46,180 INFO L87 Difference]: Start difference. First operand 409 states and 505 transitions. Second operand 3 states. [2018-12-03 17:54:46,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:46,355 INFO L93 Difference]: Finished difference Result 945 states and 1155 transitions. [2018-12-03 17:54:46,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:54:46,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 17:54:46,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:46,358 INFO L225 Difference]: With dead ends: 945 [2018-12-03 17:54:46,358 INFO L226 Difference]: Without dead ends: 423 [2018-12-03 17:54:46,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:46,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-12-03 17:54:46,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 349. [2018-12-03 17:54:46,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-12-03 17:54:46,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 416 transitions. [2018-12-03 17:54:46,439 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 416 transitions. Word has length 50 [2018-12-03 17:54:46,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:46,439 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 416 transitions. [2018-12-03 17:54:46,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:54:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 416 transitions. [2018-12-03 17:54:46,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 17:54:46,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:46,441 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 17:54:46,441 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:46,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:46,445 INFO L82 PathProgramCache]: Analyzing trace with hash 47747323, now seen corresponding path program 3 times [2018-12-03 17:54:46,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:46,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:46,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:54:46,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:46,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:46,514 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-12-03 17:54:46,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:54:46,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:54:46,515 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:54:46,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:54:46,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:54:46,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:46,516 INFO L87 Difference]: Start difference. First operand 349 states and 416 transitions. Second operand 3 states. [2018-12-03 17:54:46,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:46,528 INFO L93 Difference]: Finished difference Result 351 states and 418 transitions. [2018-12-03 17:54:46,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:54:46,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 17:54:46,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:46,529 INFO L225 Difference]: With dead ends: 351 [2018-12-03 17:54:46,529 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 17:54:46,530 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:54:46,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 17:54:46,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 17:54:46,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 17:54:46,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 17:54:46,531 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-12-03 17:54:46,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:46,531 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 17:54:46,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:54:46,531 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 17:54:46,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 17:54:46,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 17:54:46,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:46,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:48,019 WARN L180 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-12-03 17:54:48,251 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 17:54:48,473 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2018-12-03 17:54:48,603 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 17:54:48,810 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-12-03 17:54:48,924 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-12-03 17:54:49,044 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 17:54:49,162 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 17:54:49,358 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2018-12-03 17:54:49,445 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 74 385) no Hoare annotation was computed. [2018-12-03 17:54:49,445 INFO L444 ceAbstractionStarter]: At program point L318(lines 312 319) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse2 (< 0 (+ (div ~send2 256) 1))) (.cse3 (<= (div ~mode2 256) 0)) (.cse4 (<= 1 ~mode3)) (.cse6 (<= (div ~mode3 256) 0)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse7) (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse6 .cse5 .cse7))) [2018-12-03 17:54:49,446 INFO L444 ceAbstractionStarter]: At program point L382(lines 252 382) the Hoare annotation is: (let ((.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse2 (div ~mode2 256)) (.cse4 (= 0 (+ ~nomsg 1))) (.cse0 (div ~mode3 256))) (or (and (= ~mode3 (* 256 .cse0)) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (= ~mode2 (* 256 .cse2)) .cse3 .cse4 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse1 .cse3 (<= .cse2 0) (<= 1 ~mode3) .cse4 (<= .cse0 0)))) [2018-12-03 17:54:49,446 INFO L444 ceAbstractionStarter]: At program point L275(lines 270 276) the Hoare annotation is: (let ((.cse2 (div ~mode2 256)) (.cse4 (div ~mode3 256)) (.cse0 (<= ~send2 127)) (.cse1 (< 0 (+ (div ~send2 256) 1))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) (<= 1 ~mode3) .cse3 (<= .cse4 0)) (and (= ~mode2 (* 256 .cse2)) (and (= ~mode3 (* 256 .cse4)) .cse0 .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256))))))) [2018-12-03 17:54:49,446 INFO L444 ceAbstractionStarter]: At program point L298(lines 289 299) the Hoare annotation is: (let ((.cse8 (div ~mode3 256))) (let ((.cse0 (= ~mode3 (* 256 .cse8))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~send2 127)) (.cse4 (< 0 (+ (div ~send2 256) 1))) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7) (and (and (not (= ~p2_old ~nomsg)) .cse2 .cse4 .cse6) (<= 1 ~mode3) (<= .cse8 0)) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse7)))) [2018-12-03 17:54:49,446 INFO L444 ceAbstractionStarter]: At program point L259(lines 259 271) the Hoare annotation is: (let ((.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse2 (div ~mode2 256)) (.cse4 (= 0 (+ ~nomsg 1))) (.cse0 (div ~mode3 256))) (or (and (= ~mode3 (* 256 .cse0)) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (= ~mode2 (* 256 .cse2)) .cse3 .cse4 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse1 .cse3 (<= .cse2 0) (<= 1 ~mode3) .cse4 (<= .cse0 0)))) [2018-12-03 17:54:49,446 INFO L444 ceAbstractionStarter]: At program point L323(lines 323 333) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse2 (< 0 (+ (div ~send2 256) 1))) (.cse3 (<= (div ~mode2 256) 0)) (.cse4 (<= 1 ~mode3)) (.cse6 (<= (div ~mode3 256) 0)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse7) (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse6 .cse5 .cse7))) [2018-12-03 17:54:49,447 INFO L444 ceAbstractionStarter]: At program point L352(lines 352 359) the Hoare annotation is: (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= (div ~mode3 256) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse3 .cse4 .cse5 .cse6 .cse7))) [2018-12-03 17:54:49,447 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 74 385) no Hoare annotation was computed. [2018-12-03 17:54:49,447 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 74 385) no Hoare annotation was computed. [2018-12-03 17:54:49,447 INFO L444 ceAbstractionStarter]: At program point L379(lines 379 383) the Hoare annotation is: false [2018-12-03 17:54:49,447 INFO L444 ceAbstractionStarter]: At program point L280(lines 280 290) the Hoare annotation is: (let ((.cse2 (div ~mode2 256)) (.cse4 (div ~mode3 256)) (.cse0 (<= ~send2 127)) (.cse1 (< 0 (+ (div ~send2 256) 1))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) (<= 1 ~mode3) .cse3 (<= .cse4 0)) (and (= ~mode2 (* 256 .cse2)) (and (= ~mode3 (* 256 .cse4)) .cse0 .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256))))))) [2018-12-03 17:54:49,447 INFO L444 ceAbstractionStarter]: At program point L373(lines 373 380) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (not (= 0 ULTIMATE.start_check_~tmp~101)) (<= 1 ~mode2) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= (div ULTIMATE.start_assert_~arg 256) 0) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= (div ~mode3 256) 0) (<= 1 ULTIMATE.start_assert_~arg)) [2018-12-03 17:54:49,447 INFO L444 ceAbstractionStarter]: At program point L338(lines 332 339) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse2 (< 0 (+ (div ~send2 256) 1))) (.cse3 (<= (div ~mode2 256) 0)) (.cse4 (<= 1 ~mode3)) (.cse6 (<= (div ~mode3 256) 0)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse7) (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse6 .cse5 .cse7))) [2018-12-03 17:54:49,447 INFO L444 ceAbstractionStarter]: At program point L303(lines 303 313) the Hoare annotation is: (let ((.cse8 (div ~mode3 256))) (let ((.cse0 (= ~mode3 (* 256 .cse8))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~send2 127)) (.cse4 (< 0 (+ (div ~send2 256) 1))) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7) (and (and (not (= ~p2_old ~nomsg)) .cse2 .cse4 .cse6) (<= 1 ~mode3) (<= .cse8 0)) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse7)))) [2018-12-03 17:54:49,448 INFO L444 ceAbstractionStarter]: At program point L363(lines 358 364) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (not (= 0 ULTIMATE.start_check_~tmp~101)) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (<= (div ~mode3 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 17:54:49,448 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 384) no Hoare annotation was computed. [2018-12-03 17:54:49,470 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:54:49 BoogieIcfgContainer [2018-12-03 17:54:49,470 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 17:54:49,471 INFO L168 Benchmark]: Toolchain (without parser) took 28802.71 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: -926.8 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-12-03 17:54:49,472 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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:54:49,473 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.30 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:54:49,473 INFO L168 Benchmark]: Boogie Preprocessor took 34.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:54:49,474 INFO L168 Benchmark]: RCFGBuilder took 643.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 17:54:49,475 INFO L168 Benchmark]: TraceAbstraction took 28080.93 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -958.5 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-12-03 17:54:49,479 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.22 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 40.30 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 34.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 643.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28080.93 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -958.5 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 384]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || (((((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && 1 <= ~mode3) && ~mode3 / 256 <= 0)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 358]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && !(0 == check_~tmp~101)) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 270]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || (~mode2 == 256 * (~mode2 / 256) && (((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: (((((((((!(~p2_old == ~nomsg) && !(0 == check_~tmp~101)) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && assert_~arg / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && 1 <= assert_~arg - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || (((((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && 1 <= ~mode3) && ~mode3 / 256 <= 0)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 252]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) - InvariantResult [Line: 312]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || (~mode2 == 256 * (~mode2 / 256) && (((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 27.9s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 2.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 230 SDtfs, 197 SDslu, 195 SDs, 0 SdLazy, 164 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=409occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 19.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 310 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 133 NumberOfFragments, 1019 HoareAnnotationTreeSize, 13 FomulaSimplifications, 15464 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 13 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 275 ConstructedInterpolants, 8 QuantifiedInterpolants, 30980 SizeOfPredicates, 1 NumberOfNonLiveVariables, 244 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 182/204 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...