java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:55:58,583 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:55:58,589 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:55:58,610 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:55:58,611 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:55:58,613 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:55:58,617 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:55:58,620 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:55:58,623 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:55:58,624 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:55:58,625 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:55:58,626 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:55:58,627 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:55:58,628 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:55:58,629 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:55:58,640 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:55:58,641 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:55:58,643 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:55:58,648 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:55:58,651 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:55:58,652 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:55:58,654 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:55:58,659 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:55:58,660 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:55:58,660 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:55:58,661 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:55:58,662 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:55:58,662 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:55:58,666 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:55:58,667 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:55:58,667 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:55:58,670 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:55:58,670 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:55:58,670 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:55:58,673 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:55:58,673 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:55:58,674 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:55:58,701 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:55:58,702 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:55:58,706 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:55:58,706 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:55:58,706 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:55:58,706 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:55:58,707 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:55:58,707 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:55:58,707 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:55:58,707 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:55:58,707 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:55:58,707 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:55:58,708 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:55:58,709 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:55:58,709 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:55:58,709 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:55:58,709 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:55:58,709 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:55:58,710 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:55:58,710 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:55:58,710 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:55:58,710 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:55:58,710 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:55:58,710 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:55:58,711 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:55:58,711 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:55:58,711 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:55:58,711 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:55:58,711 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:55:58,712 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:55:58,712 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:55:58,712 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:55:58,712 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:55:58,712 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:55:58,713 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:55:58,713 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:55:58,713 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:55:58,713 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:55:58,713 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:55:58,765 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:55:58,780 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:55:58,784 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:55:58,786 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:55:58,786 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:55:58,787 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.2.ufo.BOUNDED-12.pals.c_12.bpl [2018-12-03 17:55:58,788 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl' [2018-12-03 17:55:58,880 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:55:58,882 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:55:58,882 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:55:58,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:55:58,883 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:55:58,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:58" (1/1) ... [2018-12-03 17:55:58,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:58" (1/1) ... [2018-12-03 17:55:58,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:55:58,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:55:58,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:55:58,938 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:55:58,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:58" (1/1) ... [2018-12-03 17:55:58,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:58" (1/1) ... [2018-12-03 17:55:58,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:58" (1/1) ... [2018-12-03 17:55:58,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:58" (1/1) ... [2018-12-03 17:55:58,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:58" (1/1) ... [2018-12-03 17:55:58,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:58" (1/1) ... [2018-12-03 17:55:58,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:58" (1/1) ... [2018-12-03 17:55:58,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:55:58,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:55:58,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:55:58,987 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:55:58,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:55:59,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:55:59,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:56:00,005 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:56:00,006 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 17:56:00,008 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:56:00 BoogieIcfgContainer [2018-12-03 17:56:00,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:56:00,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:56:00,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:56:00,017 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:56:00,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:58" (1/2) ... [2018-12-03 17:56:00,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74325d35 and model type pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:56:00, skipping insertion in model container [2018-12-03 17:56:00,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:56:00" (2/2) ... [2018-12-03 17:56:00,022 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl [2018-12-03 17:56:00,036 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:56:00,048 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:56:00,075 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:56:00,128 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:56:00,129 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:56:00,129 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:56:00,129 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:56:00,129 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:56:00,130 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:56:00,130 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:56:00,130 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:56:00,156 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-12-03 17:56:00,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:56:00,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:00,175 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 17:56:00,178 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:00,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:00,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-12-03 17:56:00,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:00,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:00,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:00,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:00,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:00,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:56:00,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:00,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:56:00,623 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:00,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:56:00,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:56:00,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:00,654 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-12-03 17:56:00,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:00,765 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-12-03 17:56:00,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:56:00,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 17:56:00,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:00,794 INFO L225 Difference]: With dead ends: 57 [2018-12-03 17:56:00,795 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 17:56:00,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:00,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 17:56:00,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-12-03 17:56:00,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 17:56:00,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-12-03 17:56:00,867 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-12-03 17:56:00,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:00,868 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-12-03 17:56:00,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:56:00,869 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-12-03 17:56:00,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:56:00,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:00,870 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 17:56:00,871 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:00,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:00,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-12-03 17:56:00,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:00,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:00,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:00,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:00,877 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:01,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:56:01,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:01,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:56:01,020 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:01,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:56:01,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:56:01,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:01,023 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-12-03 17:56:01,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:01,062 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-12-03 17:56:01,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:56:01,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 17:56:01,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:01,065 INFO L225 Difference]: With dead ends: 103 [2018-12-03 17:56:01,065 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 17:56:01,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:01,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 17:56:01,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-12-03 17:56:01,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 17:56:01,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-12-03 17:56:01,089 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-12-03 17:56:01,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:01,090 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-12-03 17:56:01,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:56:01,091 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-12-03 17:56:01,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:56:01,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:01,092 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 17:56:01,092 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:01,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:01,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-12-03 17:56:01,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:01,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:01,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:01,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:01,097 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:01,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:56:01,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:01,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:56:01,286 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:01,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:56:01,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:56:01,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:01,288 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 3 states. [2018-12-03 17:56:01,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:01,400 INFO L93 Difference]: Finished difference Result 199 states and 280 transitions. [2018-12-03 17:56:01,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:56:01,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 17:56:01,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:01,409 INFO L225 Difference]: With dead ends: 199 [2018-12-03 17:56:01,409 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 17:56:01,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:01,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 17:56:01,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-12-03 17:56:01,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-03 17:56:01,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 182 transitions. [2018-12-03 17:56:01,466 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 182 transitions. Word has length 18 [2018-12-03 17:56:01,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:01,468 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 182 transitions. [2018-12-03 17:56:01,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:56:01,469 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 182 transitions. [2018-12-03 17:56:01,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:56:01,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:01,470 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 17:56:01,471 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:01,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:01,471 INFO L82 PathProgramCache]: Analyzing trace with hash 823143127, now seen corresponding path program 1 times [2018-12-03 17:56:01,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:01,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:01,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:01,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:01,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:01,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:56:01,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:01,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:56:01,642 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:01,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:56:01,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:56:01,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:56:01,644 INFO L87 Difference]: Start difference. First operand 131 states and 182 transitions. Second operand 4 states. [2018-12-03 17:56:01,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:01,930 INFO L93 Difference]: Finished difference Result 277 states and 379 transitions. [2018-12-03 17:56:01,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:56:01,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-03 17:56:01,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:01,934 INFO L225 Difference]: With dead ends: 277 [2018-12-03 17:56:01,934 INFO L226 Difference]: Without dead ends: 275 [2018-12-03 17:56:01,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:56:01,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-12-03 17:56:01,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 147. [2018-12-03 17:56:01,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-03 17:56:01,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 198 transitions. [2018-12-03 17:56:01,976 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 198 transitions. Word has length 18 [2018-12-03 17:56:01,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:01,977 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 198 transitions. [2018-12-03 17:56:01,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:56:01,977 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 198 transitions. [2018-12-03 17:56:01,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:56:01,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:01,978 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 17:56:01,978 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:01,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:01,979 INFO L82 PathProgramCache]: Analyzing trace with hash 823202709, now seen corresponding path program 1 times [2018-12-03 17:56:01,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:01,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:01,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:01,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:01,982 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:02,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:56:02,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:02,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:56:02,066 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:02,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:56:02,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:56:02,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:02,067 INFO L87 Difference]: Start difference. First operand 147 states and 198 transitions. Second operand 3 states. [2018-12-03 17:56:02,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:02,176 INFO L93 Difference]: Finished difference Result 359 states and 485 transitions. [2018-12-03 17:56:02,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:56:02,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 17:56:02,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:02,179 INFO L225 Difference]: With dead ends: 359 [2018-12-03 17:56:02,179 INFO L226 Difference]: Without dead ends: 213 [2018-12-03 17:56:02,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:02,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-12-03 17:56:02,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-12-03 17:56:02,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-03 17:56:02,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-12-03 17:56:02,226 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 18 [2018-12-03 17:56:02,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:02,227 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-12-03 17:56:02,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:56:02,227 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-12-03 17:56:02,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 17:56:02,229 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:02,230 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 17:56:02,230 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:02,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:02,231 INFO L82 PathProgramCache]: Analyzing trace with hash 748385901, now seen corresponding path program 1 times [2018-12-03 17:56:02,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:02,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:02,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:02,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:02,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:02,612 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 17:56:02,617 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 17:56:02,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:02,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:56:02,619 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:02,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:56:02,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:56:02,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:02,621 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-12-03 17:56:02,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:02,766 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-12-03 17:56:02,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:56:02,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 17:56:02,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:02,771 INFO L225 Difference]: With dead ends: 633 [2018-12-03 17:56:02,771 INFO L226 Difference]: Without dead ends: 423 [2018-12-03 17:56:02,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:02,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-12-03 17:56:02,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-12-03 17:56:02,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-03 17:56:02,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-12-03 17:56:02,855 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-12-03 17:56:02,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:02,855 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-12-03 17:56:02,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:56:02,856 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-12-03 17:56:02,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 17:56:02,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:02,858 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 17:56:02,859 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:02,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:02,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1759503151, now seen corresponding path program 1 times [2018-12-03 17:56:02,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:02,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:02,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:02,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:02,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:03,216 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 17:56:03,223 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 17:56:03,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:03,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:56:03,225 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:03,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:56:03,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:56:03,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:03,227 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-12-03 17:56:03,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:03,472 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-12-03 17:56:03,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:56:03,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 17:56:03,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:03,481 INFO L225 Difference]: With dead ends: 1257 [2018-12-03 17:56:03,482 INFO L226 Difference]: Without dead ends: 839 [2018-12-03 17:56:03,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:03,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-12-03 17:56:03,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-12-03 17:56:03,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-12-03 17:56:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-12-03 17:56:03,660 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-12-03 17:56:03,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:03,661 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-12-03 17:56:03,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:56:03,661 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-12-03 17:56:03,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 17:56:03,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:03,669 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 17:56:03,672 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:03,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:03,673 INFO L82 PathProgramCache]: Analyzing trace with hash -2142437135, now seen corresponding path program 1 times [2018-12-03 17:56:03,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:03,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:03,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:03,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:03,675 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:03,829 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 17:56:03,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:03,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:56:03,830 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:03,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:56:03,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:56:03,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:03,831 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-12-03 17:56:04,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:04,187 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-12-03 17:56:04,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:56:04,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 17:56:04,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:04,199 INFO L225 Difference]: With dead ends: 2505 [2018-12-03 17:56:04,199 INFO L226 Difference]: Without dead ends: 1671 [2018-12-03 17:56:04,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:04,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-12-03 17:56:04,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-12-03 17:56:04,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-12-03 17:56:04,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-12-03 17:56:04,494 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-12-03 17:56:04,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:04,495 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-12-03 17:56:04,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:56:04,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-12-03 17:56:04,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 17:56:04,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:04,499 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 17:56:04,499 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:04,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:04,500 INFO L82 PathProgramCache]: Analyzing trace with hash 2095271859, now seen corresponding path program 1 times [2018-12-03 17:56:04,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:04,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:04,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:04,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:04,502 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:04,753 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 17:56:04,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:56:04,754 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:56:04,756 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-12-03 17:56:04,758 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 17:56:04,850 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:56:04,850 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:56:07,566 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 17:58:31,468 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:58:31,470 INFO L272 AbstractInterpreter]: Visited 26 different actions 608 times. Merged at 25 different actions 427 times. Widened at 23 different actions 241 times. Found 127 fixpoints after 17 different actions. Largest state had 0 variables. [2018-12-03 17:58:31,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:58:31,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:58:31,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:58:31,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:58:31,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:58:31,498 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:58:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:58:31,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:58:31,743 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 17:58:31,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:58:32,139 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-03 17:58:32,360 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-03 17:58:32,369 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:58:32,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:58:32,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 8 [2018-12-03 17:58:32,409 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:58:32,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 17:58:32,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 17:58:32,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:58:32,411 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 6 states. [2018-12-03 17:58:32,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:58:32,991 INFO L93 Difference]: Finished difference Result 3881 states and 4894 transitions. [2018-12-03 17:58:32,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:58:32,992 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-12-03 17:58:32,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:58:33,007 INFO L225 Difference]: With dead ends: 3881 [2018-12-03 17:58:33,007 INFO L226 Difference]: Without dead ends: 2727 [2018-12-03 17:58:33,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:58:33,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2018-12-03 17:58:33,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 2693. [2018-12-03 17:58:33,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2693 states. [2018-12-03 17:58:33,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 3316 transitions. [2018-12-03 17:58:33,415 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 3316 transitions. Word has length 34 [2018-12-03 17:58:33,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:58:33,416 INFO L480 AbstractCegarLoop]: Abstraction has 2693 states and 3316 transitions. [2018-12-03 17:58:33,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 17:58:33,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 3316 transitions. [2018-12-03 17:58:33,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 17:58:33,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:58:33,423 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 17:58:33,426 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:58:33,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:58:33,427 INFO L82 PathProgramCache]: Analyzing trace with hash -135466269, now seen corresponding path program 2 times [2018-12-03 17:58:33,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:58:33,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:58:33,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:58:33,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:58:33,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:58:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:58:33,993 WARN L180 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-12-03 17:58:34,310 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-12-03 17:58:34,646 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-12-03 17:58:34,670 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 17:58:34,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:58:34,671 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:58:34,671 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:58:34,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:58:34,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:58:34,672 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:58:34,697 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:58:34,698 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:58:34,813 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 17:58:34,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:58:34,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:58:35,294 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 19 [2018-12-03 17:58:35,587 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-03 17:58:35,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:58:35,805 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-03 17:58:35,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:58:35,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 17:58:35,839 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:58:35,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:58:35,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:58:35,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:58:35,841 INFO L87 Difference]: Start difference. First operand 2693 states and 3316 transitions. Second operand 7 states. [2018-12-03 17:58:36,160 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 17:58:36,741 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 17:58:37,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:58:37,717 INFO L93 Difference]: Finished difference Result 5825 states and 7170 transitions. [2018-12-03 17:58:37,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:58:37,718 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2018-12-03 17:58:37,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:58:37,735 INFO L225 Difference]: With dead ends: 5825 [2018-12-03 17:58:37,735 INFO L226 Difference]: Without dead ends: 3135 [2018-12-03 17:58:37,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:58:37,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-12-03 17:58:38,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-12-03 17:58:38,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-12-03 17:58:38,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-12-03 17:58:38,185 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 66 [2018-12-03 17:58:38,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:58:38,185 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-12-03 17:58:38,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:58:38,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-12-03 17:58:38,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 17:58:38,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:58:38,190 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 17:58:38,191 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:58:38,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:58:38,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1417215583, now seen corresponding path program 3 times [2018-12-03 17:58:38,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:58:38,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:58:38,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:58:38,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:58:38,194 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:58:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:58:38,426 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 17:58:38,431 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 17:58:38,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:58:38,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:58:38,432 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:58:38,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:58:38,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:58:38,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:58:38,433 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-12-03 17:58:38,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:58:38,946 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-12-03 17:58:38,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:58:38,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-03 17:58:38,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:58:38,959 INFO L225 Difference]: With dead ends: 4873 [2018-12-03 17:58:38,959 INFO L226 Difference]: Without dead ends: 2215 [2018-12-03 17:58:38,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:58:38,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-12-03 17:58:39,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-12-03 17:58:39,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-12-03 17:58:39,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-12-03 17:58:39,443 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-12-03 17:58:39,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:58:39,443 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-12-03 17:58:39,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:58:39,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-12-03 17:58:39,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 17:58:39,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:58:39,447 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 17:58:39,447 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:58:39,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:58:39,447 INFO L82 PathProgramCache]: Analyzing trace with hash 79784675, now seen corresponding path program 4 times [2018-12-03 17:58:39,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:58:39,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:58:39,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:58:39,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:58:39,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:58:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:58:39,536 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 17:58:39,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:58:39,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:58:39,537 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:58:39,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:58:39,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:58:39,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:58:39,538 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-12-03 17:58:39,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:58:39,579 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-12-03 17:58:39,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:58:39,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-03 17:58:39,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:58:39,580 INFO L225 Difference]: With dead ends: 1799 [2018-12-03 17:58:39,580 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 17:58:39,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:58:39,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 17:58:39,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 17:58:39,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 17:58:39,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 17:58:39,583 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-12-03 17:58:39,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:58:39,584 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 17:58:39,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:58:39,584 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 17:58:39,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 17:58:39,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 17:58:39,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,706 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 44 [2018-12-03 17:58:39,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,812 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 50 [2018-12-03 17:58:39,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:39,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,167 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 306 DAG size of output: 52 [2018-12-03 17:58:40,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,472 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 50 [2018-12-03 17:58:40,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,574 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 46 [2018-12-03 17:58:40,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,779 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 30 [2018-12-03 17:58:40,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:40,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:41,183 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 306 DAG size of output: 52 [2018-12-03 17:58:41,972 WARN L180 SmtUtils]: Spent 786.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-12-03 17:58:43,166 WARN L180 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-12-03 17:58:43,481 WARN L180 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-12-03 17:58:43,955 WARN L180 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2018-12-03 17:58:44,064 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2018-12-03 17:58:44,274 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-12-03 17:58:44,443 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2018-12-03 17:58:44,654 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-12-03 17:58:44,996 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2018-12-03 17:58:45,000 INFO L444 ceAbstractionStarter]: At program point L415(lines 415 425) the Hoare annotation is: (let ((.cse0 (div ~mode3 256)) (.cse2 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (= 0 (+ ~nomsg 1)))) (or (and (<= 1 ~mode3) (<= .cse0 0) (and (exists ((~send2 Int)) (let ((.cse1 (mod ~send2 256))) (and (= ~p2_old .cse1) (<= .cse1 127) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1))))) .cse2 .cse3 .cse4)) (and (exists ((~send2 Int)) (let ((.cse5 (mod ~send2 256))) (and (<= .cse5 127) (<= ~send2 127) (= ~p2_new .cse5) (< 0 (+ (div ~send2 256) 1))))) (= ~mode3 (* 256 .cse0)) (<= 1 ~mode2) (<= ~r1 1) .cse2 .cse3 (<= (div ~mode2 256) 0) .cse4))) [2018-12-03 17:58:45,000 INFO L444 ceAbstractionStarter]: At program point L535(lines 535 542) the Hoare annotation is: false [2018-12-03 17:58:45,001 INFO L444 ceAbstractionStarter]: At program point L490(lines 484 491) the Hoare annotation is: (and (exists ((~send2 Int)) (let ((.cse0 (mod ~send2 256))) (and (<= .cse0 127) (<= ~send2 127) (= ~p2_new .cse0) (< 0 (+ (div ~send2 256) 1))))) (<= 1 ~mode2) (<= ~r1 1) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (<= (div ~mode3 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 17:58:45,001 INFO L444 ceAbstractionStarter]: At program point L519(lines 514 520) the Hoare annotation is: (and (exists ((~send2 Int)) (let ((.cse0 (mod ~send2 256))) (and (= ~p2_old .cse0) (<= .cse0 127) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1))))) (<= 1 ULTIMATE.start_check_~tmp~156) (<= 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 17:58:45,001 INFO L444 ceAbstractionStarter]: At program point L387(lines 382 388) the Hoare annotation is: (let ((.cse5 (div ~mode3 256)) (.cse1 (<= ~send2 127)) (.cse2 (< 0 (+ (div ~send2 256) 1))) (.cse4 (= 0 (+ ~nomsg 1))) (.cse3 (div ~mode2 256))) (or (and (exists ((~send2 Int)) (let ((.cse0 (mod ~send2 256))) (and (= ~p2_old .cse0) (<= .cse0 127) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1))))) (<= 1 ~mode2) .cse1 .cse2 (<= .cse3 0) (<= 1 ~mode3) .cse4 (<= .cse5 0)) (and (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) (= ~mode3 (* 256 .cse5))) .cse1 .cse2 .cse4) (= ~mode2 (* 256 .cse3))))) [2018-12-03 17:58:45,001 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 544) no Hoare annotation was computed. [2018-12-03 17:58:45,001 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 544) no Hoare annotation was computed. [2018-12-03 17:58:45,002 INFO L444 ceAbstractionStarter]: At program point L470(lines 464 471) the Hoare annotation is: (and (exists ((~send2 Int)) (let ((.cse0 (mod ~send2 256))) (and (<= .cse0 127) (<= ~send2 127) (= ~p2_new .cse0) (< 0 (+ (div ~send2 256) 1))))) (<= 1 ~mode2) (<= ~r1 1) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (<= (div ~mode3 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 17:58:45,002 INFO L444 ceAbstractionStarter]: At program point L392(lines 392 402) the Hoare annotation is: (let ((.cse5 (div ~mode3 256)) (.cse1 (<= ~send2 127)) (.cse2 (< 0 (+ (div ~send2 256) 1))) (.cse4 (= 0 (+ ~nomsg 1))) (.cse3 (div ~mode2 256))) (or (and (exists ((~send2 Int)) (let ((.cse0 (mod ~send2 256))) (and (= ~p2_old .cse0) (<= .cse0 127) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1))))) (<= 1 ~mode2) .cse1 .cse2 (<= .cse3 0) (<= 1 ~mode3) .cse4 (<= .cse5 0)) (and (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) (= ~mode3 (* 256 .cse5))) .cse1 .cse2 .cse4) (= ~mode2 (* 256 .cse3))))) [2018-12-03 17:58:45,002 INFO L444 ceAbstractionStarter]: At program point L450(lines 444 451) the Hoare annotation is: (and (exists ((~send2 Int)) (let ((.cse0 (mod ~send2 256))) (and (<= .cse0 127) (<= ~send2 127) (= ~p2_new .cse0) (< 0 (+ (div ~send2 256) 1))))) (<= 1 ~mode2) (<= ~r1 1) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (<= (div ~mode3 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 17:58:45,002 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 544) no Hoare annotation was computed. [2018-12-03 17:58:45,003 INFO L444 ceAbstractionStarter]: At program point L541(lines 365 541) the Hoare annotation is: (let ((.cse5 (div ~mode3 256)) (.cse1 (<= ~send2 127)) (.cse3 (div ~mode2 256)) (.cse2 (< 0 (+ (div ~send2 256) 1))) (.cse4 (= 0 (+ ~nomsg 1)))) (or (and (exists ((~send2 Int)) (let ((.cse0 (mod ~send2 256))) (and (= ~p2_old .cse0) (<= .cse0 127) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1))))) (<= 1 ~mode2) .cse1 .cse2 (<= .cse3 0) (<= 1 ~mode3) .cse4 (<= .cse5 0)) (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) (= ~mode3 (* 256 .cse5)) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (= ~mode2 (* 256 .cse3)) .cse2 .cse4))) [2018-12-03 17:58:45,003 INFO L444 ceAbstractionStarter]: At program point L508(lines 508 515) the Hoare annotation is: (and (exists ((~send2 Int)) (let ((.cse0 (mod ~send2 256))) (and (= ~p2_old .cse0) (<= .cse0 127) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1))))) (<= 1 ~mode2) (<= ~r1 1) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (<= (div ~mode3 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 17:58:45,003 INFO L444 ceAbstractionStarter]: At program point L475(lines 475 485) the Hoare annotation is: (and (exists ((~send2 Int)) (let ((.cse0 (mod ~send2 256))) (and (<= .cse0 127) (<= ~send2 127) (= ~p2_new .cse0) (< 0 (+ (div ~send2 256) 1))))) (<= 1 ~mode2) (<= ~r1 1) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (<= (div ~mode3 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 17:58:45,004 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 543) no Hoare annotation was computed. [2018-12-03 17:58:45,004 INFO L444 ceAbstractionStarter]: At program point L372(lines 372 383) the Hoare annotation is: (let ((.cse5 (div ~mode3 256)) (.cse1 (<= ~send2 127)) (.cse3 (div ~mode2 256)) (.cse2 (< 0 (+ (div ~send2 256) 1))) (.cse4 (= 0 (+ ~nomsg 1)))) (or (and (exists ((~send2 Int)) (let ((.cse0 (mod ~send2 256))) (and (= ~p2_old .cse0) (<= .cse0 127) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1))))) (<= 1 ~mode2) .cse1 .cse2 (<= .cse3 0) (<= 1 ~mode3) .cse4 (<= .cse5 0)) (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) (= ~mode3 (* 256 .cse5)) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (= ~mode2 (* 256 .cse3)) .cse2 .cse4))) [2018-12-03 17:58:45,004 INFO L444 ceAbstractionStarter]: At program point L529(lines 529 536) the Hoare annotation is: (and (exists ((~send2 Int)) (let ((.cse0 (mod ~send2 256))) (and (= ~p2_old .cse0) (<= .cse0 127) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1))))) (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~156) (<= 1 ~mode2) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (<= (div ~mode3 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 17:58:45,004 INFO L444 ceAbstractionStarter]: At program point L430(lines 424 431) the Hoare annotation is: (and (exists ((~send2 Int)) (let ((.cse0 (mod ~send2 256))) (and (<= .cse0 127) (<= ~send2 127) (= ~p2_new .cse0) (< 0 (+ (div ~send2 256) 1))))) (<= 1 ~mode2) (<= ~r1 1) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (<= (div ~mode3 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 17:58:45,004 INFO L444 ceAbstractionStarter]: At program point L455(lines 455 465) the Hoare annotation is: (and (exists ((~send2 Int)) (let ((.cse0 (mod ~send2 256))) (and (<= .cse0 127) (<= ~send2 127) (= ~p2_new .cse0) (< 0 (+ (div ~send2 256) 1))))) (<= 1 ~mode2) (<= ~r1 1) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (<= (div ~mode3 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 17:58:45,005 INFO L444 ceAbstractionStarter]: At program point L410(lines 401 411) the Hoare annotation is: (let ((.cse0 (div ~mode3 256)) (.cse2 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (= 0 (+ ~nomsg 1)))) (or (and (<= 1 ~mode3) (<= .cse0 0) (and (exists ((~send2 Int)) (let ((.cse1 (mod ~send2 256))) (and (= ~p2_old .cse1) (<= .cse1 127) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1))))) .cse2 .cse3 .cse4)) (and (exists ((~send2 Int)) (let ((.cse5 (mod ~send2 256))) (and (<= .cse5 127) (<= ~send2 127) (= ~p2_new .cse5) (< 0 (+ (div ~send2 256) 1))))) (= ~mode3 (* 256 .cse0)) (<= 1 ~mode2) (<= ~r1 1) .cse2 .cse3 (<= (div ~mode2 256) 0) .cse4))) [2018-12-03 17:58:45,005 INFO L444 ceAbstractionStarter]: At program point L435(lines 435 445) the Hoare annotation is: (and (exists ((~send2 Int)) (let ((.cse0 (mod ~send2 256))) (and (<= .cse0 127) (<= ~send2 127) (= ~p2_new .cse0) (< 0 (+ (div ~send2 256) 1))))) (<= 1 ~mode2) (<= ~r1 1) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (<= (div ~mode3 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 17:58:45,035 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:58:45 BoogieIcfgContainer [2018-12-03 17:58:45,035 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 17:58:45,036 INFO L168 Benchmark]: Toolchain (without parser) took 166155.61 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -828.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-12-03 17:58:45,037 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:58:45,040 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.88 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:58:45,040 INFO L168 Benchmark]: Boogie Preprocessor took 48.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:58:45,041 INFO L168 Benchmark]: RCFGBuilder took 1021.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-12-03 17:58:45,041 INFO L168 Benchmark]: TraceAbstraction took 165023.37 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -881.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-12-03 17:58:45,055 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.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.88 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1021.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 165023.37 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -881.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 543]: 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: 424]: Loop Invariant Derived loop invariant: ((((((((exists ~send2 : int :: ((~send2 % 256 <= 127 && ~send2 <= 127) && ~p2_new == ~send2 % 256) && 0 < ~send2 / 256 + 1) && 1 <= ~mode2) && ~r1 <= 1) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 382]: Loop Invariant Derived loop invariant: ((((((((exists ~send2 : int :: ((~p2_old == ~send2 % 256 && ~send2 % 256 <= 127) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~mode2 == 256 * (~mode2 / 256)) - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: ((((((((exists ~send2 : int :: ((~send2 % 256 <= 127 && ~send2 <= 127) && ~p2_new == ~send2 % 256) && 0 < ~send2 / 256 + 1) && 1 <= ~mode2) && ~r1 <= 1) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 535]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 464]: Loop Invariant Derived loop invariant: ((((((((exists ~send2 : int :: ((~send2 % 256 <= 127 && ~send2 <= 127) && ~p2_new == ~send2 % 256) && 0 < ~send2 / 256 + 1) && 1 <= ~mode2) && ~r1 <= 1) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 484]: Loop Invariant Derived loop invariant: ((((((((exists ~send2 : int :: ((~send2 % 256 <= 127 && ~send2 <= 127) && ~p2_new == ~send2 % 256) && 0 < ~send2 / 256 + 1) && 1 <= ~mode2) && ~r1 <= 1) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: ((1 <= ~mode3 && ~mode3 / 256 <= 0) && (((exists ~send2 : int :: ((~p2_old == ~send2 % 256 && ~send2 % 256 <= 127) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) || ((((((((exists ~send2 : int :: ((~send2 % 256 <= 127 && ~send2 <= 127) && ~p2_new == ~send2 % 256) && 0 < ~send2 / 256 + 1) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~r1 <= 1) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 372]: Loop Invariant Derived loop invariant: ((((((((exists ~send2 : int :: ((~p2_old == ~send2 % 256 && ~send2 % 256 <= 127) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || (((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: ((((((((exists ~send2 : int :: ((~send2 % 256 <= 127 && ~send2 <= 127) && ~p2_new == ~send2 % 256) && 0 < ~send2 / 256 + 1) && 1 <= ~mode2) && ~r1 <= 1) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 392]: Loop Invariant Derived loop invariant: ((((((((exists ~send2 : int :: ((~p2_old == ~send2 % 256 && ~send2 % 256 <= 127) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~mode2 == 256 * (~mode2 / 256)) - InvariantResult [Line: 365]: Loop Invariant Derived loop invariant: ((((((((exists ~send2 : int :: ((~p2_old == ~send2 % 256 && ~send2 % 256 <= 127) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || (((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) - InvariantResult [Line: 455]: Loop Invariant Derived loop invariant: ((((((((exists ~send2 : int :: ((~send2 % 256 <= 127 && ~send2 <= 127) && ~p2_new == ~send2 % 256) && 0 < ~send2 / 256 + 1) && 1 <= ~mode2) && ~r1 <= 1) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 514]: Loop Invariant Derived loop invariant: ((((((((exists ~send2 : int :: ((~p2_old == ~send2 % 256 && ~send2 % 256 <= 127) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 1 <= check_~tmp~156) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0 - InvariantResult [Line: 508]: Loop Invariant Derived loop invariant: ((((((((exists ~send2 : int :: ((~p2_old == ~send2 % 256 && ~send2 % 256 <= 127) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 1 <= ~mode2) && ~r1 <= 1) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 529]: Loop Invariant Derived loop invariant: (((((((((exists ~send2 : int :: ((~p2_old == ~send2 % 256 && ~send2 % 256 <= 127) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && assert_~arg == 1) && 1 <= check_~tmp~156) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 475]: Loop Invariant Derived loop invariant: ((((((((exists ~send2 : int :: ((~send2 % 256 <= 127 && ~send2 <= 127) && ~p2_new == ~send2 % 256) && 0 < ~send2 / 256 + 1) && 1 <= ~mode2) && ~r1 <= 1) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 401]: Loop Invariant Derived loop invariant: ((1 <= ~mode3 && ~mode3 / 256 <= 0) && (((exists ~send2 : int :: ((~p2_old == ~send2 % 256 && ~send2 % 256 <= 127) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) || ((((((((exists ~send2 : int :: ((~send2 % 256 <= 127 && ~send2 <= 127) && ~p2_new == ~send2 % 256) && 0 < ~send2 / 256 + 1) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~r1 <= 1) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 164.8s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 4.6s AutomataDifference, 0.0s DeadEndRemovalTime, 5.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 408 SDtfs, 207 SDslu, 328 SDs, 0 SdLazy, 132 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 205 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2693occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 146.7s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 1626 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 1180 HoareAnnotationTreeSize, 17 FomulaSimplifications, 97820 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 17 FomulaSimplificationsInter, 1260 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 524 NumberOfCodeBlocks, 492 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 608 ConstructedInterpolants, 18 QuantifiedInterpolants, 213012 SizeOfPredicates, 13 NumberOfNonLiveVariables, 700 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 450/576 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...