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_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:39:05,603 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:39:05,606 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:39:05,624 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:39:05,624 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:39:05,626 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:39:05,627 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:39:05,631 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:39:05,632 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:39:05,635 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:39:05,637 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:39:05,638 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:39:05,639 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:39:05,640 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:39:05,641 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:39:05,641 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:39:05,650 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:39:05,655 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:39:05,657 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:39:05,662 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:39:05,664 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:39:05,665 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:39:05,668 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:39:05,670 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:39:05,670 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:39:05,671 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:39:05,672 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:39:05,673 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:39:05,676 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:39:05,677 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:39:05,678 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:39:05,678 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:39:05,680 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:39:05,680 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:39:05,681 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:39:05,682 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:39:05,682 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:39:05,703 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:39:05,704 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:39:05,705 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:39:05,705 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:39:05,706 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:39:05,706 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:39:05,706 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:39:05,706 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:39:05,706 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:39:05,709 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:39:05,710 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:39:05,710 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:39:05,710 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:39:05,710 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:39:05,710 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:39:05,711 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:39:05,711 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:39:05,713 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:39:05,713 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:39:05,714 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:39:05,714 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:39:05,714 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:39:05,714 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:39:05,714 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:39:05,715 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:39:05,715 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:39:05,715 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:39:05,716 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:39:05,716 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:39:05,716 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:39:05,716 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:39:05,717 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:39:05,717 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:39:05,717 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:39:05,718 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:39:05,718 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:39:05,718 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:39:05,718 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:39:05,719 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:39:05,719 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:39:05,719 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:39:05,770 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:39:05,785 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:39:05,791 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:39:05,793 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:39:05,793 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:39:05,794 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.5.1.ufo.UNBOUNDED.pals.c_11.bpl [2018-12-03 15:39:05,795 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl' [2018-12-03 15:39:05,893 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:39:05,896 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:39:05,897 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:39:05,897 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:39:05,897 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:39:05,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:05" (1/1) ... [2018-12-03 15:39:05,937 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:05" (1/1) ... [2018-12-03 15:39:05,955 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:39:05,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:39:05,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:39:05,956 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:39:05,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:05" (1/1) ... [2018-12-03 15:39:05,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:05" (1/1) ... [2018-12-03 15:39:05,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:05" (1/1) ... [2018-12-03 15:39:05,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:05" (1/1) ... [2018-12-03 15:39:05,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:05" (1/1) ... [2018-12-03 15:39:05,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:05" (1/1) ... [2018-12-03 15:39:05,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:05" (1/1) ... [2018-12-03 15:39:06,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:39:06,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:39:06,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:39:06,007 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:39:06,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:05" (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 15:39:06,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:39:06,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:39:06,669 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:39:06,670 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:39:06,671 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:39:06 BoogieIcfgContainer [2018-12-03 15:39:06,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:39:06,672 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:39:06,672 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:39:06,675 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:39:06,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:05" (1/2) ... [2018-12-03 15:39:06,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663770f0 and model type pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:39:06, skipping insertion in model container [2018-12-03 15:39:06,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:39:06" (2/2) ... [2018-12-03 15:39:06,678 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl [2018-12-03 15:39:06,688 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:39:06,696 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:39:06,715 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:39:06,750 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:39:06,751 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:39:06,751 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:39:06,751 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:39:06,751 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:39:06,752 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:39:06,752 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:39:06,752 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:39:06,769 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-12-03 15:39:06,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:39:06,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:06,778 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:39:06,781 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:06,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:06,787 INFO L82 PathProgramCache]: Analyzing trace with hash -417618663, now seen corresponding path program 1 times [2018-12-03 15:39:06,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:06,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:06,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:06,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:06,857 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:07,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:07,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:07,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:39:07,057 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:07,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:07,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:07,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:07,081 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-12-03 15:39:07,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:07,136 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2018-12-03 15:39:07,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:07,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 15:39:07,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:07,150 INFO L225 Difference]: With dead ends: 51 [2018-12-03 15:39:07,150 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:39:07,155 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 15:39:07,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:39:07,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-12-03 15:39:07,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 15:39:07,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-12-03 15:39:07,208 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2018-12-03 15:39:07,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:07,209 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-12-03 15:39:07,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:07,209 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-12-03 15:39:07,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:39:07,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:07,210 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:39:07,211 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:07,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:07,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735913, now seen corresponding path program 1 times [2018-12-03 15:39:07,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:07,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:07,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:07,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:07,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:07,410 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 15:39:07,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:07,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:39:07,411 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:07,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:07,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:07,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:07,414 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-12-03 15:39:07,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:07,450 INFO L93 Difference]: Finished difference Result 91 states and 127 transitions. [2018-12-03 15:39:07,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:07,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 15:39:07,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:07,452 INFO L225 Difference]: With dead ends: 91 [2018-12-03 15:39:07,453 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 15:39:07,454 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 15:39:07,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 15:39:07,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-12-03 15:39:07,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 15:39:07,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-12-03 15:39:07,472 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16 [2018-12-03 15:39:07,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:07,473 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-12-03 15:39:07,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:07,473 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-12-03 15:39:07,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:39:07,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:07,475 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:39:07,475 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:07,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:07,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1821762923, now seen corresponding path program 1 times [2018-12-03 15:39:07,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:07,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:07,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:07,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:07,479 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:07,585 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 15:39:07,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:07,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:39:07,586 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:07,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:07,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:07,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:07,590 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 3 states. [2018-12-03 15:39:07,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:07,666 INFO L93 Difference]: Finished difference Result 175 states and 244 transitions. [2018-12-03 15:39:07,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:07,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 15:39:07,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:07,677 INFO L225 Difference]: With dead ends: 175 [2018-12-03 15:39:07,678 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 15:39:07,680 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 15:39:07,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 15:39:07,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-12-03 15:39:07,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 15:39:07,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2018-12-03 15:39:07,727 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 16 [2018-12-03 15:39:07,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:07,727 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2018-12-03 15:39:07,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:07,728 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2018-12-03 15:39:07,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:39:07,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:07,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:39:07,729 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:07,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:07,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1764504621, now seen corresponding path program 1 times [2018-12-03 15:39:07,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:07,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:07,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:07,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:07,732 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:07,929 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 15:39:07,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:07,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:39:07,932 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:07,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:39:07,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:39:07,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:39:07,934 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand 4 states. [2018-12-03 15:39:08,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:08,255 INFO L93 Difference]: Finished difference Result 245 states and 331 transitions. [2018-12-03 15:39:08,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:39:08,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-03 15:39:08,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:08,258 INFO L225 Difference]: With dead ends: 245 [2018-12-03 15:39:08,259 INFO L226 Difference]: Without dead ends: 243 [2018-12-03 15:39:08,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:39:08,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-12-03 15:39:08,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 131. [2018-12-03 15:39:08,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-03 15:39:08,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 174 transitions. [2018-12-03 15:39:08,297 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 174 transitions. Word has length 16 [2018-12-03 15:39:08,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:08,297 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 174 transitions. [2018-12-03 15:39:08,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:39:08,298 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 174 transitions. [2018-12-03 15:39:08,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:39:08,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:08,299 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:39:08,299 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:08,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:08,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1764564203, now seen corresponding path program 1 times [2018-12-03 15:39:08,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:08,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:08,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:08,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:08,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:08,382 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 15:39:08,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:08,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:39:08,383 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:08,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:08,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:08,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:08,384 INFO L87 Difference]: Start difference. First operand 131 states and 174 transitions. Second operand 3 states. [2018-12-03 15:39:08,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:08,454 INFO L93 Difference]: Finished difference Result 319 states and 425 transitions. [2018-12-03 15:39:08,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:08,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 15:39:08,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:08,456 INFO L225 Difference]: With dead ends: 319 [2018-12-03 15:39:08,457 INFO L226 Difference]: Without dead ends: 189 [2018-12-03 15:39:08,458 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 15:39:08,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-03 15:39:08,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-12-03 15:39:08,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-03 15:39:08,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 248 transitions. [2018-12-03 15:39:08,516 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 248 transitions. Word has length 16 [2018-12-03 15:39:08,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:08,516 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 248 transitions. [2018-12-03 15:39:08,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:08,517 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 248 transitions. [2018-12-03 15:39:08,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:39:08,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:08,519 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:39:08,519 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:08,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:08,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1265916431, now seen corresponding path program 1 times [2018-12-03 15:39:08,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:08,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:08,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:08,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:08,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:08,818 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 15:39:08,822 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:08,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:08,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:39:08,822 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:08,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:08,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:08,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:08,824 INFO L87 Difference]: Start difference. First operand 189 states and 248 transitions. Second operand 3 states. [2018-12-03 15:39:08,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:08,942 INFO L93 Difference]: Finished difference Result 561 states and 738 transitions. [2018-12-03 15:39:08,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:08,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 15:39:08,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:08,946 INFO L225 Difference]: With dead ends: 561 [2018-12-03 15:39:08,946 INFO L226 Difference]: Without dead ends: 375 [2018-12-03 15:39:08,948 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 15:39:08,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-12-03 15:39:09,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2018-12-03 15:39:09,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-12-03 15:39:09,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions. [2018-12-03 15:39:09,023 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 30 [2018-12-03 15:39:09,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:09,023 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 480 transitions. [2018-12-03 15:39:09,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:09,024 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions. [2018-12-03 15:39:09,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:39:09,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:09,026 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:39:09,026 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:09,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:09,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1524081869, now seen corresponding path program 1 times [2018-12-03 15:39:09,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:09,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:09,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:09,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:09,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:09,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:09,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:39:09,184 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:09,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:09,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:09,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:09,185 INFO L87 Difference]: Start difference. First operand 373 states and 480 transitions. Second operand 3 states. [2018-12-03 15:39:09,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:09,375 INFO L93 Difference]: Finished difference Result 1113 states and 1434 transitions. [2018-12-03 15:39:09,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:09,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 15:39:09,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:09,384 INFO L225 Difference]: With dead ends: 1113 [2018-12-03 15:39:09,384 INFO L226 Difference]: Without dead ends: 743 [2018-12-03 15:39:09,387 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 15:39:09,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-12-03 15:39:09,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2018-12-03 15:39:09,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-12-03 15:39:09,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 932 transitions. [2018-12-03 15:39:09,519 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 932 transitions. Word has length 30 [2018-12-03 15:39:09,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:09,519 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 932 transitions. [2018-12-03 15:39:09,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:09,519 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 932 transitions. [2018-12-03 15:39:09,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:39:09,529 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:09,529 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:39:09,530 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:09,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:09,530 INFO L82 PathProgramCache]: Analyzing trace with hash -714735243, now seen corresponding path program 1 times [2018-12-03 15:39:09,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:09,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:09,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:09,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:09,533 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:09,844 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-12-03 15:39:09,864 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:09,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:09,864 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:39:09,865 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-03 15:39:09,867 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50], [54], [56], [58] [2018-12-03 15:39:09,915 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:39:09,916 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:39:11,162 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:39:11,164 INFO L272 AbstractInterpreter]: Visited 23 different actions 130 times. Merged at 22 different actions 74 times. Widened at 1 different actions 1 times. Found 30 fixpoints after 13 different actions. Largest state had 0 variables. [2018-12-03 15:39:11,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:11,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:39:11,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:11,216 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 15:39:11,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:11,235 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:39:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:11,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:39:11,643 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:39:11,643 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:39:11,997 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:39:12,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:39:12,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2018-12-03 15:39:12,029 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:39:12,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:39:12,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:39:12,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:39:12,032 INFO L87 Difference]: Start difference. First operand 741 states and 932 transitions. Second operand 7 states. [2018-12-03 15:39:12,707 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-03 15:39:12,951 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-03 15:39:14,507 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 15:39:14,766 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-12-03 15:39:15,314 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 15:39:15,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:15,499 INFO L93 Difference]: Finished difference Result 1609 states and 2019 transitions. [2018-12-03 15:39:15,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 15:39:15,499 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-12-03 15:39:15,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:15,503 INFO L225 Difference]: With dead ends: 1609 [2018-12-03 15:39:15,503 INFO L226 Difference]: Without dead ends: 565 [2018-12-03 15:39:15,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:39:15,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-12-03 15:39:15,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 515. [2018-12-03 15:39:15,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-12-03 15:39:15,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 606 transitions. [2018-12-03 15:39:15,611 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 606 transitions. Word has length 30 [2018-12-03 15:39:15,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:15,611 INFO L480 AbstractCegarLoop]: Abstraction has 515 states and 606 transitions. [2018-12-03 15:39:15,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:39:15,611 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 606 transitions. [2018-12-03 15:39:15,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 15:39:15,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:15,615 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 15:39:15,616 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:15,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:15,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1918843925, now seen corresponding path program 2 times [2018-12-03 15:39:15,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:15,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:15,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:15,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:15,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:15,710 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-12-03 15:39:15,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:15,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:39:15,712 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:15,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:15,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:15,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:15,713 INFO L87 Difference]: Start difference. First operand 515 states and 606 transitions. Second operand 3 states. [2018-12-03 15:39:15,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:15,731 INFO L93 Difference]: Finished difference Result 515 states and 606 transitions. [2018-12-03 15:39:15,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:15,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-12-03 15:39:15,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:15,732 INFO L225 Difference]: With dead ends: 515 [2018-12-03 15:39:15,732 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:39:15,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:15,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:39:15,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:39:15,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:39:15,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:39:15,734 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-12-03 15:39:15,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:15,735 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:39:15,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:15,736 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:39:15,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:39:15,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:39:16,275 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-12-03 15:39:17,608 WARN L180 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2018-12-03 15:39:17,781 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-12-03 15:39:18,010 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-12-03 15:39:18,208 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-12-03 15:39:18,335 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-12-03 15:39:18,622 WARN L180 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2018-12-03 15:39:18,797 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2018-12-03 15:39:18,982 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-12-03 15:39:19,120 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-12-03 15:39:19,329 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-12-03 15:39:19,641 WARN L180 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2018-12-03 15:39:19,743 INFO L444 ceAbstractionStarter]: At program point L415(lines 409 416) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse6 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse6 1)) (<= .cse6 0)))) .cse4 .cse5))) [2018-12-03 15:39:19,743 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 463) no Hoare annotation was computed. [2018-12-03 15:39:19,744 INFO L444 ceAbstractionStarter]: At program point L461(lines 308 461) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div ~send1 256) 1))) (.cse2 (<= ~send1 127)) (.cse1 (div ~mode2 256)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 .cse1)) .cse2 .cse3 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse2 (<= .cse1 0) .cse3))) [2018-12-03 15:39:19,744 INFO L444 ceAbstractionStarter]: At program point L395(lines 389 396) the Hoare annotation is: (let ((.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (not (= ~p1_new ~nomsg))) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse5 .cse6))) [2018-12-03 15:39:19,744 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 91 464) no Hoare annotation was computed. [2018-12-03 15:39:19,744 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 91 464) no Hoare annotation was computed. [2018-12-03 15:39:19,745 INFO L444 ceAbstractionStarter]: At program point L375(lines 369 376) the Hoare annotation is: (let ((.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (not (= ~p1_new ~nomsg))) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse5 .cse6))) [2018-12-03 15:39:19,745 INFO L444 ceAbstractionStarter]: At program point L400(lines 400 410) the Hoare annotation is: (let ((.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (not (= ~p1_new ~nomsg))) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse5 .cse6))) [2018-12-03 15:39:19,745 INFO L444 ceAbstractionStarter]: At program point L458(lines 458 462) the Hoare annotation is: false [2018-12-03 15:39:19,746 INFO L444 ceAbstractionStarter]: At program point L355(lines 349 356) the Hoare annotation is: (let ((.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (not (= ~p1_new ~nomsg))) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse5 .cse6))) [2018-12-03 15:39:19,746 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 91 464) no Hoare annotation was computed. [2018-12-03 15:39:19,746 INFO L444 ceAbstractionStarter]: At program point L380(lines 380 390) the Hoare annotation is: (let ((.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (not (= ~p1_new ~nomsg))) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse5 .cse6))) [2018-12-03 15:39:19,746 INFO L444 ceAbstractionStarter]: At program point L442(lines 438 443) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 1 ULTIMATE.start_check_~tmp~130) (<= 1 ~mode2) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= (div ~mode2 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 15:39:19,746 INFO L444 ceAbstractionStarter]: At program point L335(lines 326 336) the Hoare annotation is: (let ((.cse9 (div ~mode2 256))) (let ((.cse2 (not (= ~p1_new ~nomsg))) (.cse8 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= .cse9 0)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse8) (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 (= ~mode2 (* 256 .cse9)) .cse4 .cse6 .cse8) (and .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse3 .cse4 .cse5 .cse6)))) [2018-12-03 15:39:19,747 INFO L444 ceAbstractionStarter]: At program point L360(lines 360 370) the Hoare annotation is: (let ((.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (not (= ~p1_new ~nomsg))) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse5 .cse6))) [2018-12-03 15:39:19,747 INFO L444 ceAbstractionStarter]: At program point L315(lines 315 327) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div ~send1 256) 1))) (.cse2 (<= ~send1 127)) (.cse1 (div ~mode2 256)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 .cse1)) .cse2 .cse3 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse2 (<= .cse1 0) .cse3))) [2018-12-03 15:39:19,747 INFO L444 ceAbstractionStarter]: At program point L340(lines 340 350) the Hoare annotation is: (let ((.cse9 (div ~mode2 256))) (let ((.cse2 (not (= ~p1_new ~nomsg))) (.cse8 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= .cse9 0)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse8) (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 (= ~mode2 (* 256 .cse9)) .cse4 .cse6 .cse8) (and .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse3 .cse4 .cse5 .cse6)))) [2018-12-03 15:39:19,748 INFO L444 ceAbstractionStarter]: At program point L431(lines 431 439) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse6 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse6 1)) (<= .cse6 0)))) .cse4 .cse5))) [2018-12-03 15:39:19,748 INFO L444 ceAbstractionStarter]: At program point L452(lines 452 459) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 1 ULTIMATE.start_check_~tmp~130) (<= 1 ~mode2) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= (div ~mode2 256) 0) (<= (div ULTIMATE.start_assert_~arg 256) 0) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg)) [2018-12-03 15:39:19,774 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:39:19 BoogieIcfgContainer [2018-12-03 15:39:19,774 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:39:19,775 INFO L168 Benchmark]: Toolchain (without parser) took 13881.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 829.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -774.7 MB). Peak memory consumption was 616.4 MB. Max. memory is 7.1 GB. [2018-12-03 15:39:19,776 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:39:19,777 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.57 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:39:19,777 INFO L168 Benchmark]: Boogie Preprocessor took 47.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:39:19,778 INFO L168 Benchmark]: RCFGBuilder took 667.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-12-03 15:39:19,778 INFO L168 Benchmark]: TraceAbstraction took 13102.32 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 829.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -817.0 MB). Peak memory consumption was 574.2 MB. Max. memory is 7.1 GB. [2018-12-03 15:39:19,783 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.57 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 667.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13102.32 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 829.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -817.0 MB). Peak memory consumption was 574.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 463]: 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: 452]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 1 <= check_~tmp~130) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg - InvariantResult [Line: 349]: Loop Invariant Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 308]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 389]: Loop Invariant Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 458]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 409]: Loop Invariant Derived loop invariant: ((((((1 <= ~mode2 && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (((((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || (((((!(~p1_old == ~nomsg) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || ((((((!(~p1_old == ~nomsg) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 360]: Loop Invariant Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 315]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 1 <= check_~tmp~130) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: (((((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || (((((!(~p1_old == ~nomsg) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || ((((((!(~p1_old == ~nomsg) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 431]: Loop Invariant Derived loop invariant: ((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 13.0s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 4.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 269 SDtfs, 238 SDslu, 219 SDs, 0 SdLazy, 187 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=741occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 172 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 325 NumberOfFragments, 1543 HoareAnnotationTreeSize, 15 FomulaSimplifications, 19666 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 15 FomulaSimplificationsInter, 100 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 277 ConstructedInterpolants, 10 QuantifiedInterpolants, 32053 SizeOfPredicates, 1 NumberOfNonLiveVariables, 296 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 130/154 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...