java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:42:17,696 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:42:17,698 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:42:17,711 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:42:17,711 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:42:17,712 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:42:17,713 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:42:17,715 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:42:17,717 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:42:17,718 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:42:17,719 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:42:17,719 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:42:17,720 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:42:17,721 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:42:17,722 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:42:17,723 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:42:17,724 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:42:17,726 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:42:17,728 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:42:17,730 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:42:17,731 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:42:17,732 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:42:17,735 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:42:17,735 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:42:17,736 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:42:17,737 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:42:17,738 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:42:17,738 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:42:17,739 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:42:17,741 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:42:17,741 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:42:17,742 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:42:17,742 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:42:17,742 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:42:17,743 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:42:17,744 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:42:17,744 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:42:17,763 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:42:17,763 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:42:17,764 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:42:17,764 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:42:17,767 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:42:17,767 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:42:17,768 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:42:17,768 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:42:17,768 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:42:17,768 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:42:17,768 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:42:17,769 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:42:17,769 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:42:17,769 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:42:17,769 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:42:17,771 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:42:17,771 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:42:17,772 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:42:17,772 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:42:17,772 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:42:17,772 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:42:17,772 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:42:17,774 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:42:17,774 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:42:17,774 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:42:17,774 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:42:17,775 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:42:17,775 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:42:17,775 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:42:17,775 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:42:17,775 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:42:17,776 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:42:17,776 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:42:17,776 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:42:17,777 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:42:17,777 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:42:17,777 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:42:17,777 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:42:17,777 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:42:17,777 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:42:17,778 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:42:17,825 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:42:17,841 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:42:17,846 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:42:17,848 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:42:17,848 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:42:17,849 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.2.ufo.UNBOUNDED.pals.c_12.bpl [2018-12-03 16:42:17,850 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl' [2018-12-03 16:42:17,939 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:42:17,941 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:42:17,942 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:42:17,942 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:42:17,943 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:42:17,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:17" (1/1) ... [2018-12-03 16:42:17,983 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:17" (1/1) ... [2018-12-03 16:42:17,998 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:42:17,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:42:17,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:42:17,999 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:42:18,013 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:17" (1/1) ... [2018-12-03 16:42:18,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:17" (1/1) ... [2018-12-03 16:42:18,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:17" (1/1) ... [2018-12-03 16:42:18,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:17" (1/1) ... [2018-12-03 16:42:18,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:17" (1/1) ... [2018-12-03 16:42:18,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:17" (1/1) ... [2018-12-03 16:42:18,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:17" (1/1) ... [2018-12-03 16:42:18,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:42:18,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:42:18,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:42:18,062 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:42:18,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:42:18,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:42:18,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:42:18,784 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:42:18,785 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:42:18,785 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:42:18 BoogieIcfgContainer [2018-12-03 16:42:18,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:42:18,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:42:18,787 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:42:18,790 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:42:18,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:17" (1/2) ... [2018-12-03 16:42:18,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7beb897e and model type pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:42:18, skipping insertion in model container [2018-12-03 16:42:18,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:42:18" (2/2) ... [2018-12-03 16:42:18,794 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl [2018-12-03 16:42:18,804 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:42:18,812 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:42:18,831 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:42:18,867 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:42:18,868 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:42:18,868 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:42:18,868 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:42:18,868 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:42:18,868 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:42:18,868 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:42:18,869 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:42:18,886 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-12-03 16:42:18,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:42:18,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:18,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:18,898 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:18,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:18,904 INFO L82 PathProgramCache]: Analyzing trace with hash -417618663, now seen corresponding path program 1 times [2018-12-03 16:42:18,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:18,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:18,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:18,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:18,967 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:19,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:19,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:19,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:19,171 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:19,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:19,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:19,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:19,192 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-12-03 16:42:19,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:19,253 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2018-12-03 16:42:19,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:19,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 16:42:19,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:19,271 INFO L225 Difference]: With dead ends: 51 [2018-12-03 16:42:19,271 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:42:19,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:19,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:42:19,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-12-03 16:42:19,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 16:42:19,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-12-03 16:42:19,324 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2018-12-03 16:42:19,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:19,324 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-12-03 16:42:19,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:19,325 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-12-03 16:42:19,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:42:19,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:19,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:19,326 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:19,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:19,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735913, now seen corresponding path program 1 times [2018-12-03 16:42:19,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:19,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:19,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:19,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:19,334 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:19,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:19,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:19,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:19,514 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:19,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:19,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:19,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:19,517 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-12-03 16:42:19,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:19,578 INFO L93 Difference]: Finished difference Result 91 states and 127 transitions. [2018-12-03 16:42:19,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:19,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 16:42:19,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:19,583 INFO L225 Difference]: With dead ends: 91 [2018-12-03 16:42:19,583 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 16:42:19,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:19,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 16:42:19,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-12-03 16:42:19,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 16:42:19,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-12-03 16:42:19,602 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16 [2018-12-03 16:42:19,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:19,603 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-12-03 16:42:19,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:19,603 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-12-03 16:42:19,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:42:19,604 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:19,604 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:19,604 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:19,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:19,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1821762923, now seen corresponding path program 1 times [2018-12-03 16:42:19,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:19,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:19,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:19,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:19,608 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:19,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:19,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:19,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:19,736 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:19,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:19,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:19,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:19,741 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 3 states. [2018-12-03 16:42:19,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:19,798 INFO L93 Difference]: Finished difference Result 175 states and 244 transitions. [2018-12-03 16:42:19,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:19,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 16:42:19,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:19,803 INFO L225 Difference]: With dead ends: 175 [2018-12-03 16:42:19,803 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 16:42:19,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:19,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 16:42:19,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-12-03 16:42:19,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 16:42:19,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2018-12-03 16:42:19,852 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 16 [2018-12-03 16:42:19,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:19,853 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2018-12-03 16:42:19,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:19,853 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2018-12-03 16:42:19,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:42:19,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:19,854 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:19,855 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:19,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:19,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1012416297, now seen corresponding path program 1 times [2018-12-03 16:42:19,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:19,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:19,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:19,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:19,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:19,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:19,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:19,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:19,993 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:19,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:19,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:19,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:19,994 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand 3 states. [2018-12-03 16:42:20,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:20,061 INFO L93 Difference]: Finished difference Result 343 states and 472 transitions. [2018-12-03 16:42:20,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:20,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 16:42:20,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:20,064 INFO L225 Difference]: With dead ends: 343 [2018-12-03 16:42:20,064 INFO L226 Difference]: Without dead ends: 229 [2018-12-03 16:42:20,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:20,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-12-03 16:42:20,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-12-03 16:42:20,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-12-03 16:42:20,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 306 transitions. [2018-12-03 16:42:20,126 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 306 transitions. Word has length 16 [2018-12-03 16:42:20,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:20,127 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 306 transitions. [2018-12-03 16:42:20,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:20,127 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 306 transitions. [2018-12-03 16:42:20,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:42:20,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:20,128 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:20,128 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:20,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:20,129 INFO L82 PathProgramCache]: Analyzing trace with hash -955157995, now seen corresponding path program 1 times [2018-12-03 16:42:20,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:20,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:20,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:20,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:20,132 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:20,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:20,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:20,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:20,208 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:20,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:20,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:20,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:20,209 INFO L87 Difference]: Start difference. First operand 227 states and 306 transitions. Second operand 3 states. [2018-12-03 16:42:20,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:20,296 INFO L93 Difference]: Finished difference Result 569 states and 770 transitions. [2018-12-03 16:42:20,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:20,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 16:42:20,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:20,300 INFO L225 Difference]: With dead ends: 569 [2018-12-03 16:42:20,301 INFO L226 Difference]: Without dead ends: 343 [2018-12-03 16:42:20,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:20,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-12-03 16:42:20,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-12-03 16:42:20,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-12-03 16:42:20,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 456 transitions. [2018-12-03 16:42:20,400 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 456 transitions. Word has length 16 [2018-12-03 16:42:20,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:20,400 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 456 transitions. [2018-12-03 16:42:20,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:20,401 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 456 transitions. [2018-12-03 16:42:20,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:42:20,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:20,402 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:20,402 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:20,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:20,402 INFO L82 PathProgramCache]: Analyzing trace with hash -955217577, now seen corresponding path program 1 times [2018-12-03 16:42:20,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:20,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:20,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:20,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:20,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:20,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:20,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:42:20,610 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:20,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:42:20,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:42:20,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:42:20,611 INFO L87 Difference]: Start difference. First operand 341 states and 456 transitions. Second operand 4 states. [2018-12-03 16:42:20,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:20,855 INFO L93 Difference]: Finished difference Result 610 states and 805 transitions. [2018-12-03 16:42:20,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:42:20,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-03 16:42:20,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:20,860 INFO L225 Difference]: With dead ends: 610 [2018-12-03 16:42:20,860 INFO L226 Difference]: Without dead ends: 608 [2018-12-03 16:42:20,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:42:20,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-12-03 16:42:20,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 373. [2018-12-03 16:42:20,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-12-03 16:42:20,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions. [2018-12-03 16:42:20,934 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 16 [2018-12-03 16:42:20,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:20,935 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 480 transitions. [2018-12-03 16:42:20,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:42:20,935 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions. [2018-12-03 16:42:20,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 16:42:20,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:20,937 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 16:42:20,938 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:20,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:20,938 INFO L82 PathProgramCache]: Analyzing trace with hash 509433139, now seen corresponding path program 1 times [2018-12-03 16:42:20,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:20,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:20,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:20,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:20,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:21,251 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 16:42:21,255 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 16:42:21,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:21,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:21,256 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:21,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:21,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:21,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:21,257 INFO L87 Difference]: Start difference. First operand 373 states and 480 transitions. Second operand 3 states. [2018-12-03 16:42:21,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:21,462 INFO L93 Difference]: Finished difference Result 1113 states and 1434 transitions. [2018-12-03 16:42:21,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:21,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 16:42:21,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:21,470 INFO L225 Difference]: With dead ends: 1113 [2018-12-03 16:42:21,470 INFO L226 Difference]: Without dead ends: 743 [2018-12-03 16:42:21,472 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 16:42:21,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-12-03 16:42:21,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2018-12-03 16:42:21,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-12-03 16:42:21,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 932 transitions. [2018-12-03 16:42:21,613 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 932 transitions. Word has length 30 [2018-12-03 16:42:21,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:21,613 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 932 transitions. [2018-12-03 16:42:21,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:21,613 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 932 transitions. [2018-12-03 16:42:21,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 16:42:21,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:21,622 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 16:42:21,622 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:21,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:21,622 INFO L82 PathProgramCache]: Analyzing trace with hash 251267701, now seen corresponding path program 1 times [2018-12-03 16:42:21,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:21,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:21,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:21,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:21,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:21,902 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2018-12-03 16:42:22,093 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:22,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:22,093 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:42:22,095 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-03 16:42:22,099 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 16:42:22,163 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:42:22,163 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:42:23,737 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:42:23,739 INFO L272 AbstractInterpreter]: Visited 23 different actions 163 times. Merged at 22 different actions 103 times. Widened at 12 different actions 12 times. Found 35 fixpoints after 12 different actions. Largest state had 0 variables. [2018-12-03 16:42:23,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:23,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:42:23,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:23,785 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:42:23,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:23,801 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:42:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:23,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:42:24,245 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 16:42:24,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:42:24,556 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 16:42:24,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:42:24,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2018-12-03 16:42:24,588 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:42:24,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:42:24,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:42:24,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:42:24,589 INFO L87 Difference]: Start difference. First operand 741 states and 932 transitions. Second operand 7 states. [2018-12-03 16:42:25,375 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-03 16:42:27,384 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 16:42:27,644 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 16:42:27,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:27,831 INFO L93 Difference]: Finished difference Result 2109 states and 2642 transitions. [2018-12-03 16:42:27,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:42:27,831 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-12-03 16:42:27,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:27,839 INFO L225 Difference]: With dead ends: 2109 [2018-12-03 16:42:27,839 INFO L226 Difference]: Without dead ends: 1371 [2018-12-03 16:42:27,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:42:27,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2018-12-03 16:42:28,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 933. [2018-12-03 16:42:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-12-03 16:42:28,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1156 transitions. [2018-12-03 16:42:28,079 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1156 transitions. Word has length 30 [2018-12-03 16:42:28,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:28,080 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1156 transitions. [2018-12-03 16:42:28,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:42:28,080 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1156 transitions. [2018-12-03 16:42:28,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 16:42:28,084 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:28,084 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 16:42:28,084 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:28,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:28,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1989135149, now seen corresponding path program 2 times [2018-12-03 16:42:28,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:28,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:28,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:28,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:28,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:28,418 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 16:42:28,426 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-03 16:42:28,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:28,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:28,427 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:28,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:28,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:28,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:28,428 INFO L87 Difference]: Start difference. First operand 933 states and 1156 transitions. Second operand 3 states. [2018-12-03 16:42:28,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:28,882 INFO L93 Difference]: Finished difference Result 2161 states and 2654 transitions. [2018-12-03 16:42:28,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:28,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-12-03 16:42:28,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:28,888 INFO L225 Difference]: With dead ends: 2161 [2018-12-03 16:42:28,888 INFO L226 Difference]: Without dead ends: 975 [2018-12-03 16:42:28,890 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 16:42:28,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-12-03 16:42:29,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 797. [2018-12-03 16:42:29,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-12-03 16:42:29,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 959 transitions. [2018-12-03 16:42:29,117 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 959 transitions. Word has length 58 [2018-12-03 16:42:29,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:29,118 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 959 transitions. [2018-12-03 16:42:29,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:29,118 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 959 transitions. [2018-12-03 16:42:29,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 16:42:29,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:29,120 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 16:42:29,120 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:29,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:29,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1225807471, now seen corresponding path program 3 times [2018-12-03 16:42:29,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:29,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:29,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:42:29,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:29,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:29,201 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 16:42:29,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:29,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:29,201 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:29,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:29,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:29,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:29,203 INFO L87 Difference]: Start difference. First operand 797 states and 959 transitions. Second operand 3 states. [2018-12-03 16:42:29,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:29,230 INFO L93 Difference]: Finished difference Result 799 states and 961 transitions. [2018-12-03 16:42:29,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:29,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-12-03 16:42:29,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:29,231 INFO L225 Difference]: With dead ends: 799 [2018-12-03 16:42:29,231 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:42:29,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:29,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:42:29,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:42:29,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:42:29,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:42:29,234 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-12-03 16:42:29,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:29,234 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:42:29,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:29,234 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:42:29,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:42:29,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:42:29,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,435 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 30 [2018-12-03 16:42:29,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:30,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:30,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:30,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:30,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:30,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:30,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:30,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:30,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:30,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:30,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:30,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:30,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:30,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:30,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:30,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:30,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:30,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:30,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:30,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:30,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:30,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:30,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:30,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:30,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:30,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:30,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:32,062 WARN L180 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2018-12-03 16:42:32,338 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-12-03 16:42:32,872 WARN L180 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2018-12-03 16:42:32,998 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2018-12-03 16:42:33,288 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2018-12-03 16:42:33,471 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2018-12-03 16:42:33,742 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2018-12-03 16:42:33,896 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-12-03 16:42:34,263 WARN L180 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2018-12-03 16:42:34,502 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2018-12-03 16:42:34,732 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2018-12-03 16:42:34,736 INFO L444 ceAbstractionStarter]: At program point L353(lines 344 354) the Hoare annotation is: (let ((.cse10 (div ~send2 256)) (.cse8 (div ~mode3 256))) (let ((.cse0 (= ~mode3 (* 256 .cse8))) (.cse1 (<= 1 ~mode2)) (.cse2 (not (= ~send2 (+ (* 256 .cse10) 255)))) (.cse3 (< 0 (+ .cse10 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~mode4 (* 256 (div ~mode4 256)))) (and (<= 1 ~mode3) (<= .cse8 0) (and (not (= ~p2_old ~nomsg)) .cse2 .cse3 .cse5)) (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse9 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse9 1)) (<= .cse9 0)))) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_check_~tmp~128) (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse5 (<= 1 ULTIMATE.start_assert_~arg) .cse7 .cse6)))) [2018-12-03 16:42:34,737 INFO L444 ceAbstractionStarter]: At program point L378(lines 378 387) the Hoare annotation is: (let ((.cse9 (div ~send2 256))) (let ((.cse1 (not (= ~send2 (+ (* 256 .cse9) 255)))) (.cse2 (< 0 (+ .cse9 1))) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= (div ~mode3 256) 0)) (.cse7 (not (= ~p2_new ~nomsg))) (.cse0 (<= 1 ~mode2)) (.cse3 (<= (div ~mode2 256) 0))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse7 (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse2 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse4 .cse5 .cse6 .cse7 (<= (mod ~r1 256) 0) .cse0 .cse3 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg))))) [2018-12-03 16:42:34,737 INFO L444 ceAbstractionStarter]: At program point L440(lines 435 441) the Hoare annotation is: (let ((.cse0 (div ~send2 256))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (not (= ~send2 (+ (* 256 .cse0) 255))) (< 0 (+ .cse0 1)) (<= (div ~mode2 256) 0) (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= (div ~mode3 256) 0))) [2018-12-03 16:42:34,737 INFO L444 ceAbstractionStarter]: At program point L358(lines 358 368) the Hoare annotation is: (let ((.cse10 (div ~send2 256)) (.cse8 (div ~mode3 256))) (let ((.cse0 (= ~mode3 (* 256 .cse8))) (.cse1 (<= 1 ~mode2)) (.cse2 (not (= ~send2 (+ (* 256 .cse10) 255)))) (.cse3 (< 0 (+ .cse10 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~mode4 (* 256 (div ~mode4 256)))) (and (<= 1 ~mode3) (<= .cse8 0) (and (not (= ~p2_old ~nomsg)) .cse2 .cse3 .cse5)) (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse9 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse9 1)) (<= .cse9 0)))) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_check_~tmp~128) (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse5 (<= 1 ULTIMATE.start_assert_~arg) .cse7 .cse6)))) [2018-12-03 16:42:34,737 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 461) no Hoare annotation was computed. [2018-12-03 16:42:34,737 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 91 462) no Hoare annotation was computed. [2018-12-03 16:42:34,737 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 91 462) no Hoare annotation was computed. [2018-12-03 16:42:34,737 INFO L444 ceAbstractionStarter]: At program point L429(lines 429 436) the Hoare annotation is: (let ((.cse9 (div ~send2 256))) (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (not (= ~send2 (+ (* 256 .cse9) 255)))) (.cse4 (< 0 (+ .cse9 1))) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= (div ~mode3 256) 0))) (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 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~r1 (* 256 (div ~r1 256))))))) [2018-12-03 16:42:34,738 INFO L444 ceAbstractionStarter]: At program point L330(lines 325 331) the Hoare annotation is: (let ((.cse5 (div ~send2 256))) (let ((.cse2 (div ~mode2 256)) (.cse4 (div ~mode3 256)) (.cse0 (not (= ~send2 (+ (* 256 .cse5) 255)))) (.cse1 (< 0 (+ .cse5 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 (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 .cse4)) .cse0 .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))))))) [2018-12-03 16:42:34,738 INFO L444 ceAbstractionStarter]: At program point L450(lines 450 457) the Hoare annotation is: (let ((.cse0 (div ~send2 256))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (not (= ~send2 (+ (* 256 .cse0) 255))) (< 0 (+ .cse0 1)) (<= (div ~mode2 256) 0) (<= 1 ULTIMATE.start_check_~tmp~128) (<= (div ULTIMATE.start_assert_~arg 256) 0) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= (div ~mode3 256) 0) (<= 1 ULTIMATE.start_assert_~arg))) [2018-12-03 16:42:34,738 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 91 462) no Hoare annotation was computed. [2018-12-03 16:42:34,738 INFO L444 ceAbstractionStarter]: At program point L413(lines 407 414) the Hoare annotation is: (let ((.cse9 (div ~send2 256))) (let ((.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~send2 (+ (* 256 .cse9) 255)))) (.cse3 (< 0 (+ .cse9 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= (div ~mode3 256) 0)) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse2 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse2 1)) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8)))) [2018-12-03 16:42:34,738 INFO L444 ceAbstractionStarter]: At program point L314(lines 314 326) the Hoare annotation is: (let ((.cse5 (div ~send2 256))) (let ((.cse4 (div ~mode3 256)) (.cse2 (div ~mode2 256)) (.cse0 (not (= ~send2 (+ (* 256 .cse5) 255)))) (.cse1 (< 0 (+ .cse5 1))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) (<= 1 ~mode3) .cse3 (<= .cse4 0)) (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 .cse4)) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 .cse2)) .cse0 .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))))))) [2018-12-03 16:42:34,738 INFO L444 ceAbstractionStarter]: At program point L335(lines 335 345) the Hoare annotation is: (let ((.cse5 (div ~send2 256))) (let ((.cse2 (div ~mode2 256)) (.cse4 (div ~mode3 256)) (.cse0 (not (= ~send2 (+ (* 256 .cse5) 255)))) (.cse1 (< 0 (+ .cse5 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 (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 .cse4)) .cse0 .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))))))) [2018-12-03 16:42:34,739 INFO L444 ceAbstractionStarter]: At program point L459(lines 307 459) the Hoare annotation is: (let ((.cse5 (div ~send2 256))) (let ((.cse4 (div ~mode3 256)) (.cse2 (div ~mode2 256)) (.cse0 (not (= ~send2 (+ (* 256 .cse5) 255)))) (.cse1 (< 0 (+ .cse5 1))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) (<= 1 ~mode3) .cse3 (<= .cse4 0)) (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 .cse4)) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 .cse2)) .cse0 .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))))))) [2018-12-03 16:42:34,739 INFO L444 ceAbstractionStarter]: At program point L393(lines 386 394) the Hoare annotation is: (let ((.cse9 (div ~send2 256))) (let ((.cse1 (not (= ~send2 (+ (* 256 .cse9) 255)))) (.cse2 (< 0 (+ .cse9 1))) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= (div ~mode3 256) 0)) (.cse7 (not (= ~p2_new ~nomsg))) (.cse0 (<= 1 ~mode2)) (.cse3 (<= (div ~mode2 256) 0))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .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 .cse5 .cse6 .cse7) (and .cse1 .cse2 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse4 .cse5 .cse6 .cse7 (<= (mod ~r1 256) 0) .cse0 .cse3 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg))))) [2018-12-03 16:42:34,739 INFO L444 ceAbstractionStarter]: At program point L373(lines 367 374) the Hoare annotation is: (let ((.cse9 (div ~send2 256))) (let ((.cse1 (not (= ~send2 (+ (* 256 .cse9) 255)))) (.cse2 (< 0 (+ .cse9 1))) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= (div ~mode3 256) 0)) (.cse7 (not (= ~p2_new ~nomsg))) (.cse0 (<= 1 ~mode2)) (.cse3 (<= (div ~mode2 256) 0))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse7 (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse2 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse4 .cse5 .cse6 .cse7 (<= (mod ~r1 256) 0) .cse0 .cse3 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg))))) [2018-12-03 16:42:34,739 INFO L444 ceAbstractionStarter]: At program point L398(lines 398 408) the Hoare annotation is: (let ((.cse9 (div ~send2 256))) (let ((.cse1 (not (= ~send2 (+ (* 256 .cse9) 255)))) (.cse2 (< 0 (+ .cse9 1))) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= (div ~mode3 256) 0)) (.cse7 (not (= ~p2_new ~nomsg))) (.cse0 (<= 1 ~mode2)) (.cse3 (<= (div ~mode2 256) 0))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .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 .cse5 .cse6 .cse7) (and .cse1 .cse2 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse4 .cse5 .cse6 .cse7 (<= (mod ~r1 256) 0) .cse0 .cse3 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg))))) [2018-12-03 16:42:34,739 INFO L444 ceAbstractionStarter]: At program point L456(lines 456 460) the Hoare annotation is: false [2018-12-03 16:42:34,764 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:42:34 BoogieIcfgContainer [2018-12-03 16:42:34,764 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:42:34,765 INFO L168 Benchmark]: Toolchain (without parser) took 16825.25 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 850.9 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -268.0 MB). Peak memory consumption was 582.9 MB. Max. memory is 7.1 GB. [2018-12-03 16:42:34,766 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:42:34,767 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:42:34,767 INFO L168 Benchmark]: Boogie Preprocessor took 62.08 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:42:34,768 INFO L168 Benchmark]: RCFGBuilder took 724.09 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-12-03 16:42:34,769 INFO L168 Benchmark]: TraceAbstraction took 15977.93 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 850.9 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -310.3 MB). Peak memory consumption was 540.6 MB. Max. memory is 7.1 GB. [2018-12-03 16:42:34,773 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 56.18 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 62.08 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 724.09 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15977.93 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 850.9 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -310.3 MB). Peak memory consumption was 540.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 461]: 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: 398]: Loop Invariant Derived loop invariant: ((((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && !(~send2 == 256 * (~send2 / 256) + 255)) && 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 == 256 * (~send2 / 256) + 255)) && (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) && !(~p2_new == ~nomsg))) || (((((((((((!(~send2 == 256 * (~send2 / 256) + 255) && 0 < ~send2 / 256 + 1) && assert_~arg / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && ~mode2 / 256 <= 0) && 1 <= check_~tmp~128) && 1 <= assert_~arg) - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && !(~send2 == 256 * (~send2 / 256) + 255)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= check_~tmp~128) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0 - InvariantResult [Line: 429]: Loop Invariant Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && !(~send2 == 256 * (~send2 / 256) + 255)) && (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) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && !(~send2 == 256 * (~send2 / 256) + 255)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: (((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && !(~send2 == 256 * (~send2 / 256) + 255)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= check_~tmp~128) && assert_~arg / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && 1 <= assert_~arg - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~send2 == 256 * (~send2 / 256) + 255)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) || ((1 <= ~mode3 && ~mode3 / 256 <= 0) && ((!(~p2_old == ~nomsg) && !(~send2 == 256 * (~send2 / 256) + 255)) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && !(~send2 == 256 * (~send2 / 256) + 255)) && (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))) || ((((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && !(~send2 == 256 * (~send2 / 256) + 255)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= check_~tmp~128) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && !(~send2 == 256 * (~send2 / 256) + 255)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && !(~send2 == 256 * (~send2 / 256) + 255)) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && !(~send2 == 256 * (~send2 / 256) + 255)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) || ((((((((1 <= ~mode2 && !(~send2 == 256 * (~send2 / 256) + 255)) && (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) && !(~p2_new == ~nomsg))) || (((((((((((!(~send2 == 256 * (~send2 / 256) + 255) && 0 < ~send2 / 256 + 1) && assert_~arg / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && ~mode2 / 256 <= 0) && 1 <= check_~tmp~128) && 1 <= assert_~arg) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && !(~send2 == 256 * (~send2 / 256) + 255)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || (~mode2 == 256 * (~mode2 / 256) && (((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && !(~send2 == 256 * (~send2 / 256) + 255)) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: ((((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && !(~send2 == 256 * (~send2 / 256) + 255)) && 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 == 256 * (~send2 / 256) + 255)) && (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) && !(~p2_new == ~nomsg))) || (((((((((((!(~send2 == 256 * (~send2 / 256) + 255) && 0 < ~send2 / 256 + 1) && assert_~arg / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && ~mode2 / 256 <= 0) && 1 <= check_~tmp~128) && 1 <= assert_~arg) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 407]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && !(~send2 == 256 * (~send2 / 256) + 255)) && (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) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && !(~send2 == 256 * (~send2 / 256) + 255)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 358]: Loop Invariant Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~send2 == 256 * (~send2 / 256) + 255)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) || ((1 <= ~mode3 && ~mode3 / 256 <= 0) && ((!(~p2_old == ~nomsg) && !(~send2 == 256 * (~send2 / 256) + 255)) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && !(~send2 == 256 * (~send2 / 256) + 255)) && (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))) || ((((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && !(~send2 == 256 * (~send2 / 256) + 255)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= check_~tmp~128) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && !(~send2 == 256 * (~send2 / 256) + 255)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && !(~send2 == 256 * (~send2 / 256) + 255)) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 378]: Loop Invariant Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && !(~send2 == 256 * (~send2 / 256) + 255)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) || ((((((((1 <= ~mode2 && !(~send2 == 256 * (~send2 / 256) + 255)) && (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) && !(~p2_new == ~nomsg))) || (((((((((((!(~send2 == 256 * (~send2 / 256) + 255) && 0 < ~send2 / 256 + 1) && assert_~arg / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && ~mode2 / 256 <= 0) && 1 <= check_~tmp~128) && 1 <= assert_~arg) - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && !(~send2 == 256 * (~send2 / 256) + 255)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || (~mode2 == 256 * (~mode2 / 256) && (((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && !(~send2 == 256 * (~send2 / 256) + 255)) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 15.8s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 4.6s AutomataDifference, 0.0s DeadEndRemovalTime, 5.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 300 SDtfs, 277 SDslu, 248 SDs, 0 SdLazy, 185 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=933occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.6s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 863 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 275 NumberOfFragments, 1883 HoareAnnotationTreeSize, 15 FomulaSimplifications, 42632 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 15 FomulaSimplificationsInter, 442 FormulaSimplificationTreeSizeReductionInter, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 302 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 320 ConstructedInterpolants, 10 QuantifiedInterpolants, 40224 SizeOfPredicates, 1 NumberOfNonLiveVariables, 294 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 198/224 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...