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.6.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:42:44,577 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:42:44,580 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:42:44,595 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:42:44,596 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:42:44,599 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:42:44,601 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:42:44,603 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:42:44,606 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:42:44,606 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:42:44,610 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:42:44,610 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:42:44,611 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:42:44,614 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:42:44,622 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:42:44,623 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:42:44,623 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:42:44,625 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:42:44,631 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:42:44,633 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:42:44,635 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:42:44,636 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:42:44,642 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:42:44,642 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:42:44,642 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:42:44,643 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:42:44,645 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:42:44,647 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:42:44,648 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:42:44,650 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:42:44,651 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:42:44,652 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:42:44,652 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:42:44,652 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:42:44,653 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:42:44,653 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:42:44,655 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:44,679 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:42:44,679 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:42:44,680 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:42:44,680 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:42:44,680 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:42:44,685 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:42:44,685 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:42:44,685 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:42:44,685 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:42:44,686 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:42:44,686 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:42:44,686 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:42:44,686 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:42:44,686 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:42:44,686 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:42:44,687 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:42:44,687 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:42:44,688 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:42:44,688 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:42:44,688 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:42:44,688 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:42:44,688 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:42:44,689 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:42:44,689 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:42:44,689 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:42:44,689 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:42:44,689 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:42:44,689 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:42:44,690 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:42:44,690 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:42:44,690 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:42:44,690 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:42:44,690 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:42:44,691 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:42:44,691 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:42:44,691 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:42:44,691 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:42:44,691 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:42:44,692 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:42:44,692 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:42:44,692 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:42:44,740 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:42:44,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:42:44,762 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:42:44,764 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:42:44,764 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:42:44,765 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.6.ufo.UNBOUNDED.pals.c_12.bpl [2018-12-03 16:42:44,766 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl' [2018-12-03 16:42:44,841 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:42:44,842 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:42:44,843 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:42:44,843 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:42:44,844 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:42:44,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:44" (1/1) ... [2018-12-03 16:42:44,882 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:44" (1/1) ... [2018-12-03 16:42:44,900 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:42:44,901 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:42:44,901 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:42:44,901 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:42:44,914 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:44" (1/1) ... [2018-12-03 16:42:44,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:44" (1/1) ... [2018-12-03 16:42:44,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:44" (1/1) ... [2018-12-03 16:42:44,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:44" (1/1) ... [2018-12-03 16:42:44,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:44" (1/1) ... [2018-12-03 16:42:44,937 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:44" (1/1) ... [2018-12-03 16:42:44,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:44" (1/1) ... [2018-12-03 16:42:44,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:42:44,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:42:44,949 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:42:44,949 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:42:44,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:44" (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:45,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:42:45,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:42:45,793 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:42:45,793 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:42:45,794 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:42:45 BoogieIcfgContainer [2018-12-03 16:42:45,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:42:45,795 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:42:45,795 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:42:45,798 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:42:45,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:44" (1/2) ... [2018-12-03 16:42:45,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb31b8c and model type pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:42:45, skipping insertion in model container [2018-12-03 16:42:45,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:42:45" (2/2) ... [2018-12-03 16:42:45,801 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl [2018-12-03 16:42:45,811 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:42:45,819 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:42:45,837 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:42:45,871 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:42:45,871 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:42:45,871 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:42:45,872 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:42:45,872 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:42:45,872 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:42:45,872 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:42:45,872 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:42:45,888 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-12-03 16:42:45,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:42:45,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:45,896 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:45,898 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:45,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:45,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-12-03 16:42:45,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:45,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:45,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:45,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:45,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:46,186 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:46,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:46,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:46,191 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:46,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:46,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:46,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:46,216 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-12-03 16:42:46,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:46,266 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-12-03 16:42:46,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:46,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 16:42:46,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:46,279 INFO L225 Difference]: With dead ends: 57 [2018-12-03 16:42:46,280 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:42:46,284 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:46,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:42:46,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-12-03 16:42:46,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 16:42:46,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-12-03 16:42:46,330 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-12-03 16:42:46,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:46,330 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-12-03 16:42:46,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:46,330 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-12-03 16:42:46,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:42:46,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:46,332 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:46,332 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:46,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:46,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-12-03 16:42:46,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:46,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:46,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:46,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:46,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:46,469 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:46,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:46,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:46,470 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:46,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:46,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:46,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:46,473 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-12-03 16:42:46,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:46,538 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-12-03 16:42:46,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:46,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 16:42:46,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:46,544 INFO L225 Difference]: With dead ends: 103 [2018-12-03 16:42:46,544 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 16:42:46,546 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:46,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 16:42:46,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-12-03 16:42:46,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 16:42:46,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-12-03 16:42:46,566 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-12-03 16:42:46,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:46,566 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-12-03 16:42:46,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:46,567 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-12-03 16:42:46,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:42:46,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:46,568 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:46,569 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:46,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:46,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-12-03 16:42:46,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:46,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:46,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:46,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:46,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:46,822 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:46,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:46,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:42:46,823 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:46,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:42:46,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:42:46,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:42:46,825 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-12-03 16:42:47,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:47,012 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-12-03 16:42:47,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:42:47,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-03 16:42:47,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:47,018 INFO L225 Difference]: With dead ends: 141 [2018-12-03 16:42:47,018 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 16:42:47,021 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:47,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 16:42:47,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-12-03 16:42:47,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 16:42:47,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-12-03 16:42:47,067 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-12-03 16:42:47,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:47,067 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-12-03 16:42:47,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:42:47,068 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-12-03 16:42:47,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:42:47,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:47,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:47,072 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:47,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:47,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-12-03 16:42:47,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:47,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:47,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:47,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:47,075 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:47,222 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:47,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:47,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:47,223 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:47,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:47,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:47,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:47,225 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-12-03 16:42:47,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:47,317 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-12-03 16:42:47,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:47,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 16:42:47,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:47,320 INFO L225 Difference]: With dead ends: 183 [2018-12-03 16:42:47,320 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 16:42:47,321 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:47,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 16:42:47,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 16:42:47,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 16:42:47,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-12-03 16:42:47,349 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-12-03 16:42:47,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:47,349 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-12-03 16:42:47,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:47,350 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-12-03 16:42:47,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:42:47,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:47,351 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:47,352 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:47,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:47,352 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-12-03 16:42:47,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:47,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:47,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:47,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:47,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:47,526 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:47,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:47,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:47,527 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:47,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:47,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:47,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:47,529 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-12-03 16:42:47,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:47,607 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-12-03 16:42:47,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:47,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 16:42:47,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:47,611 INFO L225 Difference]: With dead ends: 321 [2018-12-03 16:42:47,611 INFO L226 Difference]: Without dead ends: 215 [2018-12-03 16:42:47,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:47,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-03 16:42:47,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-12-03 16:42:47,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-03 16:42:47,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-12-03 16:42:47,656 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-12-03 16:42:47,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:47,657 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-12-03 16:42:47,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:47,657 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-12-03 16:42:47,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:42:47,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:47,659 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:47,660 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:47,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:47,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-12-03 16:42:47,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:47,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:47,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:47,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:47,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:47,811 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:47,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:47,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:47,812 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:47,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:47,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:47,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:47,813 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-12-03 16:42:47,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:47,938 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-12-03 16:42:47,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:47,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 16:42:47,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:47,942 INFO L225 Difference]: With dead ends: 633 [2018-12-03 16:42:47,942 INFO L226 Difference]: Without dead ends: 423 [2018-12-03 16:42:47,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:47,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-12-03 16:42:48,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-12-03 16:42:48,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-03 16:42:48,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-12-03 16:42:48,022 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-12-03 16:42:48,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:48,022 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-12-03 16:42:48,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:48,025 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-12-03 16:42:48,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:42:48,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:48,032 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 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:48,033 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:48,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:48,033 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-12-03 16:42:48,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:48,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:48,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:48,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:48,037 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:48,163 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:48,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:48,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:48,164 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:48,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:48,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:48,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:48,165 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-12-03 16:42:48,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:48,359 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-12-03 16:42:48,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:48,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 16:42:48,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:48,365 INFO L225 Difference]: With dead ends: 1257 [2018-12-03 16:42:48,365 INFO L226 Difference]: Without dead ends: 839 [2018-12-03 16:42:48,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:48,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-12-03 16:42:48,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-12-03 16:42:48,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-12-03 16:42:48,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-12-03 16:42:48,513 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-12-03 16:42:48,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:48,513 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-12-03 16:42:48,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:48,514 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-12-03 16:42:48,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:42:48,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:48,521 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:48,521 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:48,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:48,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-12-03 16:42:48,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:48,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:48,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:48,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:48,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:48,852 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 16:42:48,858 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:48,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:48,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:48,859 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:48,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:48,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:48,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:48,860 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-12-03 16:42:49,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:49,183 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-12-03 16:42:49,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:49,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 16:42:49,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:49,193 INFO L225 Difference]: With dead ends: 2505 [2018-12-03 16:42:49,193 INFO L226 Difference]: Without dead ends: 1671 [2018-12-03 16:42:49,195 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:49,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-12-03 16:42:49,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-12-03 16:42:49,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-12-03 16:42:49,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-12-03 16:42:49,480 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-12-03 16:42:49,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:49,481 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-12-03 16:42:49,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:49,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-12-03 16:42:49,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:42:49,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:49,485 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, 1, 1, 1, 1] [2018-12-03 16:42:49,485 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:49,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:49,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-12-03 16:42:49,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:49,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:49,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:49,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:49,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:49,871 WARN L180 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-12-03 16:42:49,899 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:49,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:49,899 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:42:49,901 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-12-03 16:42:49,905 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], [62], [64], [66] [2018-12-03 16:42:49,963 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:42:49,964 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:42:51,794 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:42:51,796 INFO L272 AbstractInterpreter]: Visited 26 different actions 212 times. Merged at 25 different actions 133 times. Never widened. Found 50 fixpoints after 16 different actions. Largest state had 0 variables. [2018-12-03 16:42:51,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:51,833 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:42:51,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:51,833 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:51,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:51,850 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:42:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:51,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:42:52,207 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:42:52,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:42:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:42:52,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:42:52,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2018-12-03 16:42:52,602 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:42:52,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:42:52,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:42:52,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:42:52,604 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-12-03 16:42:52,831 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 16:42:54,001 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-03 16:42:54,371 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-03 16:42:56,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:56,330 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-12-03 16:42:56,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:42:56,330 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-12-03 16:42:56,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:56,346 INFO L225 Difference]: With dead ends: 4801 [2018-12-03 16:42:56,346 INFO L226 Difference]: Without dead ends: 3135 [2018-12-03 16:42:56,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 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:56,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-12-03 16:42:56,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-12-03 16:42:56,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-12-03 16:42:56,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-12-03 16:42:56,770 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-12-03 16:42:56,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:56,770 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-12-03 16:42:56,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:42:56,771 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-12-03 16:42:56,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 16:42:56,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:56,775 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 16:42:56,775 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:56,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:56,777 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-12-03 16:42:56,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:56,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:56,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:56,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:56,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:56,944 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 16:42:56,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:56,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:56,944 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:56,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:56,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:56,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:56,946 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-12-03 16:42:57,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:57,399 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-12-03 16:42:57,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:57,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-03 16:42:57,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:57,411 INFO L225 Difference]: With dead ends: 4873 [2018-12-03 16:42:57,411 INFO L226 Difference]: Without dead ends: 2215 [2018-12-03 16:42:57,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:57,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-12-03 16:42:57,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-12-03 16:42:57,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-12-03 16:42:57,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-12-03 16:42:57,744 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-12-03 16:42:57,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:57,744 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-12-03 16:42:57,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:57,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-12-03 16:42:57,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 16:42:57,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:57,747 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 16:42:57,748 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:57,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:57,748 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-12-03 16:42:57,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:57,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:57,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:42:57,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:57,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:57,827 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-03 16:42:57,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:57,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:57,828 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:57,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:57,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:57,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:57,829 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-12-03 16:42:57,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:57,875 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-12-03 16:42:57,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:57,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-03 16:42:57,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:57,876 INFO L225 Difference]: With dead ends: 1799 [2018-12-03 16:42:57,876 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:42:57,879 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:57,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:42:57,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:42:57,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:42:57,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:42:57,880 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-12-03 16:42:57,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:57,880 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:42:57,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:57,880 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:42:57,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:42:57,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:42:57,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:57,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:57,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:57,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:57,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:57,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:57,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:57,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:57,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:57,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:57,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:57,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:57,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:57,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:57,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:57,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:57,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:57,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:57,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:57,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:57,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:57,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:57,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,037 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 40 [2018-12-03 16:42:58,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,296 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 48 [2018-12-03 16:42:58,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,485 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 40 [2018-12-03 16:42:58,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,574 WARN L180 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2018-12-03 16:43:00,307 WARN L180 SmtUtils]: Spent 730.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 16:43:00,460 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 16:43:00,615 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 16:43:00,837 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-12-03 16:43:00,968 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 16:43:01,085 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2018-12-03 16:43:01,206 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-12-03 16:43:01,358 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 16:43:01,506 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 16:43:01,701 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 16:43:01,864 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-12-03 16:43:01,976 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-12-03 16:43:02,106 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 16:43:02,111 INFO L444 ceAbstractionStarter]: At program point L411(lines 402 412) the Hoare annotation is: (let ((.cse8 (div ~mode3 256))) (let ((.cse0 (= ~mode3 (* 256 .cse8))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~send2 127)) (.cse4 (< 0 (+ (div ~send2 256) 1))) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7) (and (and (not (= ~p2_old ~nomsg)) .cse2 .cse4 .cse6) (<= 1 ~mode3) (<= .cse8 0)) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse7)))) [2018-12-03 16:43:02,112 INFO L444 ceAbstractionStarter]: At program point L539(lines 364 539) the Hoare annotation is: (let ((.cse4 (div ~mode3 256)) (.cse0 (<= ~send2 127)) (.cse2 (div ~mode2 256)) (.cse1 (< 0 (+ (div ~send2 256) 1))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) (<= 1 ~mode3) .cse3 (<= .cse4 0)) (and (= ~mode3 (* 256 .cse4)) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 .cse2)) .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-12-03 16:43:02,112 INFO L444 ceAbstractionStarter]: At program point L436(lines 436 446) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (<= (div ~mode3 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.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 .cse7 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-12-03 16:43:02,112 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-12-03 16:43:02,112 INFO L444 ceAbstractionStarter]: At program point L416(lines 416 426) the Hoare annotation is: (let ((.cse8 (div ~mode3 256))) (let ((.cse0 (= ~mode3 (* 256 .cse8))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~send2 127)) (.cse4 (< 0 (+ (div ~send2 256) 1))) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7) (and (and (not (= ~p2_old ~nomsg)) .cse2 .cse4 .cse6) (<= 1 ~mode3) (<= .cse8 0)) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse7)))) [2018-12-03 16:43:02,113 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-12-03 16:43:02,113 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-12-03 16:43:02,113 INFO L444 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-12-03 16:43:02,113 INFO L444 ceAbstractionStarter]: At program point L371(lines 371 383) the Hoare annotation is: (let ((.cse4 (div ~mode3 256)) (.cse0 (<= ~send2 127)) (.cse2 (div ~mode2 256)) (.cse1 (< 0 (+ (div ~send2 256) 1))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) (<= 1 ~mode3) .cse3 (<= .cse4 0)) (and (= ~mode3 (* 256 .cse4)) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 .cse2)) .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-12-03 16:43:02,113 INFO L444 ceAbstractionStarter]: At program point L491(lines 485 492) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (<= (div ~mode3 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.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 .cse7 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-12-03 16:43:02,114 INFO L444 ceAbstractionStarter]: At program point L520(lines 515 521) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ULTIMATE.start_check_~tmp~158) (<= 1 ~mode2) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= (div ~mode3 256) 0)) [2018-12-03 16:43:02,114 INFO L444 ceAbstractionStarter]: At program point L388(lines 382 389) the Hoare annotation is: (let ((.cse2 (div ~mode2 256)) (.cse4 (div ~mode3 256)) (.cse0 (<= ~send2 127)) (.cse1 (< 0 (+ (div ~send2 256) 1))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) (<= 1 ~mode3) .cse3 (<= .cse4 0)) (and (= ~mode2 (* 256 .cse2)) (and (= ~mode3 (* 256 .cse4)) .cse0 .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256))))))) [2018-12-03 16:43:02,114 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-12-03 16:43:02,114 INFO L444 ceAbstractionStarter]: At program point L471(lines 464 472) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (<= (div ~mode3 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.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 .cse7 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-12-03 16:43:02,114 INFO L444 ceAbstractionStarter]: At program point L393(lines 393 403) the Hoare annotation is: (let ((.cse2 (div ~mode2 256)) (.cse4 (div ~mode3 256)) (.cse0 (<= ~send2 127)) (.cse1 (< 0 (+ (div ~send2 256) 1))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) (<= 1 ~mode3) .cse3 (<= .cse4 0)) (and (= ~mode2 (* 256 .cse2)) (and (= ~mode3 (* 256 .cse4)) .cse0 .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256))))))) [2018-12-03 16:43:02,114 INFO L444 ceAbstractionStarter]: At program point L451(lines 445 452) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (<= (div ~mode3 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.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 .cse7 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-12-03 16:43:02,115 INFO L444 ceAbstractionStarter]: At program point L509(lines 509 516) the Hoare annotation is: (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse6 (<= (div ~mode3 256) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse3 .cse4 .cse5 .cse7 .cse6))) [2018-12-03 16:43:02,115 INFO L444 ceAbstractionStarter]: At program point L476(lines 476 486) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (<= (div ~mode3 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.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 .cse7 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-12-03 16:43:02,115 INFO L444 ceAbstractionStarter]: At program point L530(lines 530 537) the Hoare annotation is: (and (= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ULTIMATE.start_check_~tmp~158) (<= 1 ~mode2) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= (div ~mode3 256) 0)) [2018-12-03 16:43:02,115 INFO L444 ceAbstractionStarter]: At program point L431(lines 425 432) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (<= (div ~mode3 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.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 .cse7 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-12-03 16:43:02,116 INFO L444 ceAbstractionStarter]: At program point L456(lines 456 465) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (<= (div ~mode3 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.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 .cse7 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-12-03 16:43:02,137 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:43:02 BoogieIcfgContainer [2018-12-03 16:43:02,137 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:43:02,138 INFO L168 Benchmark]: Toolchain (without parser) took 17297.10 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -718.0 MB). Peak memory consumption was 808.1 MB. Max. memory is 7.1 GB. [2018-12-03 16:43:02,140 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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:43:02,140 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.25 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:43:02,141 INFO L168 Benchmark]: Boogie Preprocessor took 47.35 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:43:02,141 INFO L168 Benchmark]: RCFGBuilder took 845.50 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:43:02,142 INFO L168 Benchmark]: TraceAbstraction took 16342.67 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -760.3 MB). Peak memory consumption was 765.8 MB. Max. memory is 7.1 GB. [2018-12-03 16:43:02,146 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.21 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 57.25 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 47.35 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 845.50 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 16342.67 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -760.3 MB). Peak memory consumption was 765.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 541]: 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: 382]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || (~mode2 == 256 * (~mode2 / 256) && (((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 445]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 464]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 485]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || (((((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && 1 <= ~mode3) && ~mode3 / 256 <= 0)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 436]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || (~mode2 == 256 * (~mode2 / 256) && (((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= check_~tmp~158) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0 - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: ((((((((assert_~arg == 1 && !(~p2_old == ~nomsg)) && 1 <= check_~tmp~158) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0 - InvariantResult [Line: 476]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 364]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 402]: Loop Invariant Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || (((((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && 1 <= ~mode3) && ~mode3 / 256 <= 0)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 425]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 16.2s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 5.4s AutomataDifference, 0.0s DeadEndRemovalTime, 4.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2101occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.9s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1528 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 1388 HoareAnnotationTreeSize, 17 FomulaSimplifications, 81143 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 200 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 429 ConstructedInterpolants, 12 QuantifiedInterpolants, 63939 SizeOfPredicates, 1 NumberOfNonLiveVariables, 347 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 274/304 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...