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_oct.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 19:15:34,342 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 19:15:34,344 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 19:15:34,362 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 19:15:34,362 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 19:15:34,364 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 19:15:34,365 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 19:15:34,367 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 19:15:34,368 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 19:15:34,369 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 19:15:34,370 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 19:15:34,370 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 19:15:34,371 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 19:15:34,372 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 19:15:34,373 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 19:15:34,374 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 19:15:34,375 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 19:15:34,377 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 19:15:34,379 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 19:15:34,380 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 19:15:34,381 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 19:15:34,383 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 19:15:34,385 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 19:15:34,385 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 19:15:34,386 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 19:15:34,387 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 19:15:34,388 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 19:15:34,389 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 19:15:34,389 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 19:15:34,391 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 19:15:34,391 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 19:15:34,392 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 19:15:34,392 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 19:15:34,392 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 19:15:34,393 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 19:15:34,394 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 19:15:34,394 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-03 19:15:34,408 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 19:15:34,408 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 19:15:34,409 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 19:15:34,409 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 19:15:34,410 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 19:15:34,410 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 19:15:34,410 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 19:15:34,410 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 19:15:34,410 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 19:15:34,411 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 19:15:34,411 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 19:15:34,411 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 19:15:34,411 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 19:15:34,411 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 19:15:34,412 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 19:15:34,412 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 19:15:34,412 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 19:15:34,413 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 19:15:34,413 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 19:15:34,413 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 19:15:34,413 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 19:15:34,414 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 19:15:34,414 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 19:15:34,414 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 19:15:34,414 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 19:15:34,415 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 19:15:34,416 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 19:15:34,416 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 19:15:34,416 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 19:15:34,416 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 19:15:34,417 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 19:15:34,417 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 19:15:34,417 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 19:15:34,417 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 19:15:34,417 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 19:15:34,418 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 19:15:34,418 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 19:15:34,418 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 19:15:34,418 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 19:15:34,418 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 19:15:34,459 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 19:15:34,474 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 19:15:34,482 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 19:15:34,484 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 19:15:34,485 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 19:15:34,485 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 19:15:34,486 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 19:15:34,557 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 19:15:34,559 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 19:15:34,560 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 19:15:34,560 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 19:15:34,561 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 19:15:34,579 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 07:15:34" (1/1) ... [2018-12-03 19:15:34,597 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 07:15:34" (1/1) ... [2018-12-03 19:15:34,620 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 19:15:34,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 19:15:34,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 19:15:34,622 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 19:15:34,636 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 07:15:34" (1/1) ... [2018-12-03 19:15:34,637 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 07:15:34" (1/1) ... [2018-12-03 19:15:34,642 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 07:15:34" (1/1) ... [2018-12-03 19:15:34,646 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 07:15:34" (1/1) ... [2018-12-03 19:15:34,662 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 07:15:34" (1/1) ... [2018-12-03 19:15:34,665 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 07:15:34" (1/1) ... [2018-12-03 19:15:34,669 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 07:15:34" (1/1) ... [2018-12-03 19:15:34,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 19:15:34,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 19:15:34,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 19:15:34,674 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 19:15:34,675 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 07:15:34" (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 19:15:34,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 19:15:34,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 19:15:35,625 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 19:15:35,626 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 19:15:35,626 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 07:15:35 BoogieIcfgContainer [2018-12-03 19:15:35,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 19:15:35,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 19:15:35,628 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 19:15:35,632 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 19:15:35,632 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 07:15:34" (1/2) ... [2018-12-03 19:15:35,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e6c99b5 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 07:15:35, skipping insertion in model container [2018-12-03 19:15:35,634 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 07:15:35" (2/2) ... [2018-12-03 19:15:35,637 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl [2018-12-03 19:15:35,648 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 19:15:35,657 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 19:15:35,681 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 19:15:35,729 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 19:15:35,730 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 19:15:35,730 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 19:15:35,730 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 19:15:35,730 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 19:15:35,732 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 19:15:35,732 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 19:15:35,732 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 19:15:35,758 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-12-03 19:15:35,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 19:15:35,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:15:35,776 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 19:15:35,780 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:15:35,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:15:35,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-12-03 19:15:35,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:15:35,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:35,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:15:35,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:35,890 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:15:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:15:36,131 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 19:15:36,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:15:36,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:15:36,134 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:15:36,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:15:36,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:15:36,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:15:36,155 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-12-03 19:15:36,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:15:36,220 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-12-03 19:15:36,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:15:36,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 19:15:36,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:15:36,236 INFO L225 Difference]: With dead ends: 57 [2018-12-03 19:15:36,236 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 19:15:36,241 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 19:15:36,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 19:15:36,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-12-03 19:15:36,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 19:15:36,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-12-03 19:15:36,292 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-12-03 19:15:36,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:15:36,292 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-12-03 19:15:36,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:15:36,293 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-12-03 19:15:36,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 19:15:36,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:15:36,294 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 19:15:36,295 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:15:36,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:15:36,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-12-03 19:15:36,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:15:36,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:36,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:15:36,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:36,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:15:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:15:36,479 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 19:15:36,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:15:36,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:15:36,486 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:15:36,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:15:36,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:15:36,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:15:36,490 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-12-03 19:15:36,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:15:36,544 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-12-03 19:15:36,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:15:36,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 19:15:36,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:15:36,549 INFO L225 Difference]: With dead ends: 103 [2018-12-03 19:15:36,549 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 19:15:36,551 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 19:15:36,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 19:15:36,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-12-03 19:15:36,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 19:15:36,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-12-03 19:15:36,593 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-12-03 19:15:36,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:15:36,594 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-12-03 19:15:36,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:15:36,594 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-12-03 19:15:36,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 19:15:36,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:15:36,595 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 19:15:36,595 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:15:36,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:15:36,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-12-03 19:15:36,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:15:36,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:36,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:15:36,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:36,599 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:15:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:15:36,717 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 19:15:36,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:15:36,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:15:36,719 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:15:36,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:15:36,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:15:36,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:15:36,720 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 3 states. [2018-12-03 19:15:36,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:15:36,794 INFO L93 Difference]: Finished difference Result 199 states and 280 transitions. [2018-12-03 19:15:36,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:15:36,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 19:15:36,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:15:36,799 INFO L225 Difference]: With dead ends: 199 [2018-12-03 19:15:36,799 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 19:15:36,801 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 19:15:36,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 19:15:36,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-12-03 19:15:36,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-03 19:15:36,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 182 transitions. [2018-12-03 19:15:36,831 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 182 transitions. Word has length 18 [2018-12-03 19:15:36,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:15:36,831 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 182 transitions. [2018-12-03 19:15:36,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:15:36,831 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 182 transitions. [2018-12-03 19:15:36,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 19:15:36,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:15:36,832 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 19:15:36,833 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:15:36,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:15:36,833 INFO L82 PathProgramCache]: Analyzing trace with hash 823143127, now seen corresponding path program 1 times [2018-12-03 19:15:36,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:15:36,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:36,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:15:36,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:36,836 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:15:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:15:37,033 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 19:15:37,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:15:37,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 19:15:37,034 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:15:37,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 19:15:37,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 19:15:37,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 19:15:37,036 INFO L87 Difference]: Start difference. First operand 131 states and 182 transitions. Second operand 4 states. [2018-12-03 19:15:37,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:15:37,328 INFO L93 Difference]: Finished difference Result 277 states and 379 transitions. [2018-12-03 19:15:37,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 19:15:37,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-03 19:15:37,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:15:37,332 INFO L225 Difference]: With dead ends: 277 [2018-12-03 19:15:37,333 INFO L226 Difference]: Without dead ends: 275 [2018-12-03 19:15:37,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 19:15:37,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-12-03 19:15:37,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 147. [2018-12-03 19:15:37,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-03 19:15:37,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 198 transitions. [2018-12-03 19:15:37,381 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 198 transitions. Word has length 18 [2018-12-03 19:15:37,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:15:37,381 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 198 transitions. [2018-12-03 19:15:37,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 19:15:37,381 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 198 transitions. [2018-12-03 19:15:37,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 19:15:37,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:15:37,383 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 19:15:37,384 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:15:37,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:15:37,384 INFO L82 PathProgramCache]: Analyzing trace with hash 823202709, now seen corresponding path program 1 times [2018-12-03 19:15:37,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:15:37,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:37,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:15:37,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:37,392 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:15:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:15:37,491 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 19:15:37,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:15:37,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:15:37,493 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:15:37,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:15:37,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:15:37,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:15:37,494 INFO L87 Difference]: Start difference. First operand 147 states and 198 transitions. Second operand 3 states. [2018-12-03 19:15:37,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:15:37,616 INFO L93 Difference]: Finished difference Result 359 states and 485 transitions. [2018-12-03 19:15:37,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:15:37,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 19:15:37,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:15:37,620 INFO L225 Difference]: With dead ends: 359 [2018-12-03 19:15:37,620 INFO L226 Difference]: Without dead ends: 213 [2018-12-03 19:15:37,622 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 19:15:37,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-12-03 19:15:37,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-12-03 19:15:37,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-03 19:15:37,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-12-03 19:15:37,669 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 18 [2018-12-03 19:15:37,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:15:37,669 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-12-03 19:15:37,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:15:37,670 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-12-03 19:15:37,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 19:15:37,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:15:37,672 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 19:15:37,673 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:15:37,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:15:37,673 INFO L82 PathProgramCache]: Analyzing trace with hash 748385901, now seen corresponding path program 1 times [2018-12-03 19:15:37,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:15:37,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:37,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:15:37,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:37,676 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:15:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:15:37,811 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:15:37,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:15:37,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:15:37,811 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:15:37,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:15:37,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:15:37,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:15:37,813 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-12-03 19:15:37,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:15:37,958 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-12-03 19:15:37,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:15:37,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 19:15:37,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:15:37,962 INFO L225 Difference]: With dead ends: 633 [2018-12-03 19:15:37,962 INFO L226 Difference]: Without dead ends: 423 [2018-12-03 19:15:37,967 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 19:15:37,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-12-03 19:15:38,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-12-03 19:15:38,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-03 19:15:38,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-12-03 19:15:38,067 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-12-03 19:15:38,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:15:38,070 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-12-03 19:15:38,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:15:38,070 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-12-03 19:15:38,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 19:15:38,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:15:38,073 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 19:15:38,075 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:15:38,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:15:38,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1759503151, now seen corresponding path program 1 times [2018-12-03 19:15:38,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:15:38,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:38,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:15:38,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:38,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:15:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:15:38,402 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 19:15:38,410 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 19:15:38,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:15:38,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:15:38,411 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:15:38,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:15:38,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:15:38,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:15:38,413 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-12-03 19:15:38,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:15:38,631 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-12-03 19:15:38,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:15:38,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 19:15:38,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:15:38,637 INFO L225 Difference]: With dead ends: 1257 [2018-12-03 19:15:38,638 INFO L226 Difference]: Without dead ends: 839 [2018-12-03 19:15:38,644 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 19:15:38,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-12-03 19:15:38,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-12-03 19:15:38,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-12-03 19:15:38,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-12-03 19:15:38,801 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-12-03 19:15:38,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:15:38,801 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-12-03 19:15:38,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:15:38,802 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-12-03 19:15:38,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 19:15:38,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:15:38,809 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 19:15:38,814 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:15:38,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:15:38,814 INFO L82 PathProgramCache]: Analyzing trace with hash -2142437135, now seen corresponding path program 1 times [2018-12-03 19:15:38,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:15:38,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:38,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:15:38,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:38,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:15:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:15:38,956 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 19:15:38,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:15:38,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:15:38,957 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:15:38,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:15:38,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:15:38,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:15:38,958 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-12-03 19:15:39,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:15:39,323 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-12-03 19:15:39,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:15:39,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 19:15:39,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:15:39,334 INFO L225 Difference]: With dead ends: 2505 [2018-12-03 19:15:39,335 INFO L226 Difference]: Without dead ends: 1671 [2018-12-03 19:15:39,338 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 19:15:39,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-12-03 19:15:39,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-12-03 19:15:39,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-12-03 19:15:39,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-12-03 19:15:39,652 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-12-03 19:15:39,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:15:39,653 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-12-03 19:15:39,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:15:39,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-12-03 19:15:39,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 19:15:39,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:15:39,656 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 19:15:39,656 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:15:39,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:15:39,657 INFO L82 PathProgramCache]: Analyzing trace with hash 2095271859, now seen corresponding path program 1 times [2018-12-03 19:15:39,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:15:39,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:39,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:15:39,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:39,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:15:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:15:39,851 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 19:15:39,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:15:39,851 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:15:39,852 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-12-03 19:15:39,855 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 19:15:39,924 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 19:15:39,924 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 19:15:42,119 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 19:17:58,811 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 19:17:58,813 INFO L272 AbstractInterpreter]: Visited 26 different actions 730 times. Merged at 25 different actions 520 times. Widened at 23 different actions 277 times. Found 147 fixpoints after 16 different actions. Largest state had 0 variables. [2018-12-03 19:17:58,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:17:58,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 19:17:58,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:17:58,829 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 19:17:58,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:17:58,840 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:17:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:17:58,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:17:59,190 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-12-03 19:17:59,201 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 19:17:59,201 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:17:59,674 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 19:17:59,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:17:59,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 8 [2018-12-03 19:17:59,713 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:17:59,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 19:17:59,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 19:17:59,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2018-12-03 19:17:59,715 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 6 states. [2018-12-03 19:18:00,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:00,386 INFO L93 Difference]: Finished difference Result 3881 states and 4894 transitions. [2018-12-03 19:18:00,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 19:18:00,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-12-03 19:18:00,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:00,400 INFO L225 Difference]: With dead ends: 3881 [2018-12-03 19:18:00,401 INFO L226 Difference]: Without dead ends: 2727 [2018-12-03 19:18:00,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2018-12-03 19:18:00,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2018-12-03 19:18:00,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 2693. [2018-12-03 19:18:00,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2693 states. [2018-12-03 19:18:00,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 3316 transitions. [2018-12-03 19:18:00,795 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 3316 transitions. Word has length 34 [2018-12-03 19:18:00,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:00,796 INFO L480 AbstractCegarLoop]: Abstraction has 2693 states and 3316 transitions. [2018-12-03 19:18:00,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 19:18:00,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 3316 transitions. [2018-12-03 19:18:00,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 19:18:00,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:00,802 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 19:18:00,803 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:00,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:00,803 INFO L82 PathProgramCache]: Analyzing trace with hash -135466269, now seen corresponding path program 2 times [2018-12-03 19:18:00,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:00,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:00,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:00,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:00,806 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:01,332 WARN L180 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-12-03 19:18:01,654 WARN L180 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-12-03 19:18:01,920 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-12-03 19:18:01,926 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 19:18:01,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:18:01,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:18:01,927 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:18:01,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:18:01,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:18:01,927 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 19:18:01,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:18:01,939 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:18:02,039 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 19:18:02,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:18:02,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:18:02,385 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 19 [2018-12-03 19:18:02,562 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 19:18:02,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:18:02,747 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 19:18:02,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:18:02,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 19:18:02,779 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:18:02,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 19:18:02,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 19:18:02,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 19:18:02,780 INFO L87 Difference]: Start difference. First operand 2693 states and 3316 transitions. Second operand 7 states. [2018-12-03 19:18:03,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:03,884 INFO L93 Difference]: Finished difference Result 5825 states and 7170 transitions. [2018-12-03 19:18:03,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 19:18:03,885 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2018-12-03 19:18:03,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:03,904 INFO L225 Difference]: With dead ends: 5825 [2018-12-03 19:18:03,904 INFO L226 Difference]: Without dead ends: 3135 [2018-12-03 19:18:03,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-03 19:18:03,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-12-03 19:18:04,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-12-03 19:18:04,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-12-03 19:18:04,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-12-03 19:18:04,370 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 66 [2018-12-03 19:18:04,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:04,370 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-12-03 19:18:04,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 19:18:04,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-12-03 19:18:04,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 19:18:04,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:04,374 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 19:18:04,375 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:04,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:04,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1417215583, now seen corresponding path program 3 times [2018-12-03 19:18:04,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:04,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:04,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:18:04,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:04,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:04,515 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 19:18:04,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:04,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:18:04,516 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:04,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:04,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:04,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:04,517 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-12-03 19:18:05,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:05,166 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-12-03 19:18:05,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:05,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-03 19:18:05,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:05,177 INFO L225 Difference]: With dead ends: 4873 [2018-12-03 19:18:05,177 INFO L226 Difference]: Without dead ends: 2215 [2018-12-03 19:18:05,183 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 19:18:05,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-12-03 19:18:05,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-12-03 19:18:05,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-12-03 19:18:05,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-12-03 19:18:05,601 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-12-03 19:18:05,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:05,602 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-12-03 19:18:05,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:05,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-12-03 19:18:05,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 19:18:05,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:05,605 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 19:18:05,606 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:05,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:05,606 INFO L82 PathProgramCache]: Analyzing trace with hash 79784675, now seen corresponding path program 4 times [2018-12-03 19:18:05,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:05,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:05,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:18:05,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:05,608 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:05,685 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 19:18:05,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:05,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:18:05,686 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:05,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:05,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:05,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:05,687 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-12-03 19:18:05,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:05,728 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-12-03 19:18:05,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:05,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-03 19:18:05,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:05,728 INFO L225 Difference]: With dead ends: 1799 [2018-12-03 19:18:05,728 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 19:18:05,731 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 19:18:05,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 19:18:05,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 19:18:05,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 19:18:05,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 19:18:05,732 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-12-03 19:18:05,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:05,732 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 19:18:05,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:05,733 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 19:18:05,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 19:18:05,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 19:18:05,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,965 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 50 [2018-12-03 19:18:05,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:05,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,282 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 306 DAG size of output: 52 [2018-12-03 19:18:06,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:06,964 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 306 DAG size of output: 52 [2018-12-03 19:18:07,757 WARN L180 SmtUtils]: Spent 791.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-12-03 19:18:09,175 WARN L180 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-12-03 19:18:09,896 WARN L180 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-12-03 19:18:10,119 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2018-12-03 19:18:10,588 WARN L180 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2018-12-03 19:18:10,732 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2018-12-03 19:18:10,840 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-12-03 19:18:10,973 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-12-03 19:18:11,107 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2018-12-03 19:18:11,280 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-12-03 19:18:11,594 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2018-12-03 19:18:11,598 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 19:18:11,599 INFO L444 ceAbstractionStarter]: At program point L535(lines 535 542) the Hoare annotation is: false [2018-12-03 19:18:11,599 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 19:18:11,599 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 19:18:11,599 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 19:18:11,600 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 544) no Hoare annotation was computed. [2018-12-03 19:18:11,600 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 544) no Hoare annotation was computed. [2018-12-03 19:18:11,600 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 19:18:11,600 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 543) no Hoare annotation was computed. [2018-12-03 19:18:11,601 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 19:18:11,601 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 19:18:11,601 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 544) no Hoare annotation was computed. [2018-12-03 19:18:11,602 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 19:18:11,602 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 19:18:11,602 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 19:18:11,603 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 19:18:11,603 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 19:18:11,603 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 19:18:11,603 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 19:18:11,603 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 19:18:11,604 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 19:18:11,627 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 07:18:11 BoogieIcfgContainer [2018-12-03 19:18:11,628 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 19:18:11,629 INFO L168 Benchmark]: Toolchain (without parser) took 157070.67 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 1.9 GB in the end (delta: -454.6 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-12-03 19:18:11,630 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.30 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 19:18:11,630 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.04 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 19:18:11,631 INFO L168 Benchmark]: Boogie Preprocessor took 51.53 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 19:18:11,632 INFO L168 Benchmark]: RCFGBuilder took 952.89 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.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-12-03 19:18:11,632 INFO L168 Benchmark]: TraceAbstraction took 155999.92 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 1.9 GB in the end (delta: -507.5 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-12-03 19:18:11,637 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.30 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 61.04 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 51.53 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 952.89 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.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 155999.92 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 1.9 GB in the end (delta: -507.5 MB). Peak memory consumption was 2.1 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, 155.8s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 3.9s AutomataDifference, 0.0s DeadEndRemovalTime, 5.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 408 SDtfs, 207 SDslu, 328 SDs, 0 SdLazy, 132 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 205 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 3.2s 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, 138.9s 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.2s HoareSimplificationTime, 17 FomulaSimplificationsInter, 1260 FormulaSimplificationTreeSizeReductionInter, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.0s 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...