java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:39:38,150 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:39:38,153 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:39:38,167 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:39:38,167 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:39:38,168 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:39:38,171 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:39:38,173 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:39:38,175 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:39:38,183 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:39:38,184 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:39:38,185 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:39:38,187 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:39:38,188 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:39:38,191 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:39:38,192 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:39:38,193 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:39:38,196 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:39:38,202 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:39:38,204 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:39:38,205 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:39:38,206 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:39:38,210 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:39:38,210 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:39:38,210 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:39:38,211 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:39:38,212 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:39:38,213 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:39:38,215 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:39:38,216 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:39:38,217 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:39:38,218 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:39:38,219 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:39:38,220 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:39:38,220 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:39:38,221 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:39:38,221 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:39:38,250 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:39:38,250 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:39:38,253 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:39:38,253 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:39:38,253 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:39:38,254 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:39:38,254 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:39:38,254 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:39:38,254 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:39:38,254 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:39:38,255 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:39:38,255 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:39:38,255 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:39:38,255 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:39:38,255 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:39:38,259 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:39:38,259 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:39:38,260 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:39:38,260 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:39:38,260 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:39:38,260 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:39:38,260 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:39:38,260 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:39:38,261 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:39:38,262 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:39:38,262 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:39:38,262 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:39:38,262 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:39:38,262 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:39:38,263 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:39:38,264 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:39:38,264 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:39:38,264 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:39:38,264 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:39:38,264 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:39:38,265 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:39:38,265 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:39:38,265 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:39:38,265 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:39:38,265 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:39:38,265 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:39:38,309 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:39:38,322 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:39:38,328 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:39:38,332 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:39:38,334 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:39:38,335 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 15:39:38,335 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 15:39:38,416 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:39:38,418 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:39:38,419 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:39:38,419 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:39:38,419 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:39:38,438 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 03:39:38" (1/1) ... [2018-12-03 15:39:38,461 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 03:39:38" (1/1) ... [2018-12-03 15:39:38,475 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:39:38,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:39:38,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:39:38,477 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:39:38,490 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 03:39:38" (1/1) ... [2018-12-03 15:39:38,491 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 03:39:38" (1/1) ... [2018-12-03 15:39:38,504 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 03:39:38" (1/1) ... [2018-12-03 15:39:38,504 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 03:39:38" (1/1) ... [2018-12-03 15:39:38,515 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 03:39:38" (1/1) ... [2018-12-03 15:39:38,519 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 03:39:38" (1/1) ... [2018-12-03 15:39:38,521 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 03:39:38" (1/1) ... [2018-12-03 15:39:38,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:39:38,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:39:38,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:39:38,527 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:39:38,528 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 03:39:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:39:38,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:39:38,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:39:39,440 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:39:39,440 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:39:39,441 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 03:39:39 BoogieIcfgContainer [2018-12-03 15:39:39,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:39:39,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:39:39,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:39:39,445 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:39:39,446 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 03:39:38" (1/2) ... [2018-12-03 15:39:39,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0f64f1 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 03:39:39, skipping insertion in model container [2018-12-03 15:39:39,447 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 03:39:39" (2/2) ... [2018-12-03 15:39:39,449 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl [2018-12-03 15:39:39,459 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:39:39,468 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:39:39,484 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:39:39,524 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:39:39,525 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:39:39,525 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:39:39,525 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:39:39,525 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:39:39,525 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:39:39,526 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:39:39,527 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:39:39,544 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-12-03 15:39:39,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:39:39,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:39,553 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 15:39:39,555 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:39,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:39,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-12-03 15:39:39,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:39,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:39,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:39,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:39,627 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:39,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:39,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:39,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:39:39,866 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:39,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:39,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:39,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:39,888 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-12-03 15:39:39,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:39,953 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-12-03 15:39:39,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:39,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 15:39:39,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:39,968 INFO L225 Difference]: With dead ends: 57 [2018-12-03 15:39:39,968 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 15:39:39,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:39,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 15:39:40,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-12-03 15:39:40,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 15:39:40,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-12-03 15:39:40,020 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-12-03 15:39:40,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:40,020 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-12-03 15:39:40,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:40,020 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-12-03 15:39:40,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:39:40,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:40,021 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 15:39:40,022 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:40,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:40,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-12-03 15:39:40,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:40,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:40,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:40,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:40,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:40,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:40,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:40,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:39:40,188 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:40,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:40,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:40,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:40,191 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-12-03 15:39:40,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:40,229 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-12-03 15:39:40,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:40,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 15:39:40,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:40,232 INFO L225 Difference]: With dead ends: 103 [2018-12-03 15:39:40,232 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 15:39:40,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:40,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 15:39:40,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-12-03 15:39:40,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 15:39:40,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-12-03 15:39:40,256 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-12-03 15:39:40,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:40,257 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-12-03 15:39:40,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:40,257 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-12-03 15:39:40,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:39:40,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:40,259 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 15:39:40,259 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:40,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:40,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-12-03 15:39:40,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:40,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:40,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:40,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:40,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:40,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:40,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:40,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:39:40,398 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:40,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:40,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:40,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:40,400 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 3 states. [2018-12-03 15:39:40,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:40,463 INFO L93 Difference]: Finished difference Result 199 states and 280 transitions. [2018-12-03 15:39:40,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:40,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 15:39:40,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:40,468 INFO L225 Difference]: With dead ends: 199 [2018-12-03 15:39:40,468 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 15:39:40,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:40,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 15:39:40,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-12-03 15:39:40,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-03 15:39:40,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 182 transitions. [2018-12-03 15:39:40,522 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 182 transitions. Word has length 18 [2018-12-03 15:39:40,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:40,523 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 182 transitions. [2018-12-03 15:39:40,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:40,523 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 182 transitions. [2018-12-03 15:39:40,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:39:40,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:40,524 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 15:39:40,524 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:40,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:40,525 INFO L82 PathProgramCache]: Analyzing trace with hash 823143127, now seen corresponding path program 1 times [2018-12-03 15:39:40,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:40,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:40,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:40,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:40,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:40,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:40,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:40,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:39:40,650 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:40,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:39:40,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:39:40,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:39:40,651 INFO L87 Difference]: Start difference. First operand 131 states and 182 transitions. Second operand 4 states. [2018-12-03 15:39:40,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:40,846 INFO L93 Difference]: Finished difference Result 277 states and 379 transitions. [2018-12-03 15:39:40,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:39:40,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-03 15:39:40,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:40,850 INFO L225 Difference]: With dead ends: 277 [2018-12-03 15:39:40,850 INFO L226 Difference]: Without dead ends: 275 [2018-12-03 15:39:40,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:39:40,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-12-03 15:39:40,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 147. [2018-12-03 15:39:40,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-03 15:39:40,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 198 transitions. [2018-12-03 15:39:40,894 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 198 transitions. Word has length 18 [2018-12-03 15:39:40,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:40,894 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 198 transitions. [2018-12-03 15:39:40,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:39:40,894 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 198 transitions. [2018-12-03 15:39:40,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:39:40,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:40,895 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 15:39:40,896 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:40,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:40,896 INFO L82 PathProgramCache]: Analyzing trace with hash 823202709, now seen corresponding path program 1 times [2018-12-03 15:39:40,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:40,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:40,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:40,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:40,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:41,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:41,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:41,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:39:41,024 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:41,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:41,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:41,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:41,026 INFO L87 Difference]: Start difference. First operand 147 states and 198 transitions. Second operand 3 states. [2018-12-03 15:39:41,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:41,120 INFO L93 Difference]: Finished difference Result 359 states and 485 transitions. [2018-12-03 15:39:41,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:41,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 15:39:41,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:41,123 INFO L225 Difference]: With dead ends: 359 [2018-12-03 15:39:41,123 INFO L226 Difference]: Without dead ends: 213 [2018-12-03 15:39:41,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:41,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-12-03 15:39:41,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-12-03 15:39:41,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-03 15:39:41,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-12-03 15:39:41,176 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 18 [2018-12-03 15:39:41,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:41,176 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-12-03 15:39:41,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:41,177 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-12-03 15:39:41,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 15:39:41,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:41,182 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 15:39:41,182 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:41,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:41,183 INFO L82 PathProgramCache]: Analyzing trace with hash 748385901, now seen corresponding path program 1 times [2018-12-03 15:39:41,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:41,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:41,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:41,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:41,185 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:41,419 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 15:39:41,424 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 15:39:41,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:41,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:39:41,425 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:41,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:41,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:41,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:41,426 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-12-03 15:39:41,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:41,554 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-12-03 15:39:41,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:41,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 15:39:41,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:41,558 INFO L225 Difference]: With dead ends: 633 [2018-12-03 15:39:41,558 INFO L226 Difference]: Without dead ends: 423 [2018-12-03 15:39:41,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:41,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-12-03 15:39:41,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-12-03 15:39:41,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-03 15:39:41,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-12-03 15:39:41,634 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-12-03 15:39:41,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:41,634 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-12-03 15:39:41,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:41,635 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-12-03 15:39:41,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 15:39:41,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:41,638 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 15:39:41,638 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:41,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:41,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1759503151, now seen corresponding path program 1 times [2018-12-03 15:39:41,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:41,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:41,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:41,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:41,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:41,875 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 15:39:41,881 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 15:39:41,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:41,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:39:41,882 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:41,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:41,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:41,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:41,883 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-12-03 15:39:42,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:42,101 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-12-03 15:39:42,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:42,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 15:39:42,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:42,111 INFO L225 Difference]: With dead ends: 1257 [2018-12-03 15:39:42,112 INFO L226 Difference]: Without dead ends: 839 [2018-12-03 15:39:42,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:42,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-12-03 15:39:42,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-12-03 15:39:42,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-12-03 15:39:42,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-12-03 15:39:42,260 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-12-03 15:39:42,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:42,261 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-12-03 15:39:42,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:42,261 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-12-03 15:39:42,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 15:39:42,267 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:42,273 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 15:39:42,273 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:42,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:42,273 INFO L82 PathProgramCache]: Analyzing trace with hash -2142437135, now seen corresponding path program 1 times [2018-12-03 15:39:42,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:42,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:42,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:42,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:42,276 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:42,592 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 15:39:42,596 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 15:39:42,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:42,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:39:42,597 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:42,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:42,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:42,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:42,598 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-12-03 15:39:42,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:42,957 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-12-03 15:39:42,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:42,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 15:39:42,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:42,969 INFO L225 Difference]: With dead ends: 2505 [2018-12-03 15:39:42,969 INFO L226 Difference]: Without dead ends: 1671 [2018-12-03 15:39:42,971 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 15:39:42,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-12-03 15:39:43,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-12-03 15:39:43,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-12-03 15:39:43,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-12-03 15:39:43,263 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-12-03 15:39:43,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:43,263 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-12-03 15:39:43,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:43,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-12-03 15:39:43,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 15:39:43,267 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:43,267 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 15:39:43,267 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:43,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:43,268 INFO L82 PathProgramCache]: Analyzing trace with hash 2095271859, now seen corresponding path program 1 times [2018-12-03 15:39:43,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:43,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:43,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:43,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:43,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:43,566 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 15:39:43,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:43,567 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:39:43,568 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-12-03 15:39:43,570 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 15:39:43,619 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:39:43,619 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:39:45,392 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:39:45,394 INFO L272 AbstractInterpreter]: Visited 26 different actions 191 times. Merged at 25 different actions 119 times. Widened at 1 different actions 1 times. Found 45 fixpoints after 17 different actions. Largest state had 0 variables. [2018-12-03 15:39:45,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:45,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:39:45,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:45,435 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:39:45,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:45,450 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:39:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:45,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:39:45,738 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 15:39:45,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:39:46,096 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-03 15:39:46,309 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 15:39:46,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:39:46,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 8 [2018-12-03 15:39:46,341 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:39:46,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:39:46,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:39:46,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:39:46,345 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 6 states. [2018-12-03 15:39:46,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:46,998 INFO L93 Difference]: Finished difference Result 3881 states and 4894 transitions. [2018-12-03 15:39:46,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:39:46,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-12-03 15:39:46,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:47,014 INFO L225 Difference]: With dead ends: 3881 [2018-12-03 15:39:47,014 INFO L226 Difference]: Without dead ends: 2727 [2018-12-03 15:39:47,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:39:47,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2018-12-03 15:39:47,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 2693. [2018-12-03 15:39:47,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2693 states. [2018-12-03 15:39:47,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 3316 transitions. [2018-12-03 15:39:47,458 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 3316 transitions. Word has length 34 [2018-12-03 15:39:47,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:47,458 INFO L480 AbstractCegarLoop]: Abstraction has 2693 states and 3316 transitions. [2018-12-03 15:39:47,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:39:47,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 3316 transitions. [2018-12-03 15:39:47,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 15:39:47,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:47,466 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 15:39:47,466 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:47,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:47,470 INFO L82 PathProgramCache]: Analyzing trace with hash -135466269, now seen corresponding path program 2 times [2018-12-03 15:39:47,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:47,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:47,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:47,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:47,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:48,028 WARN L180 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-12-03 15:39:48,281 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-12-03 15:39:48,585 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-12-03 15:39:48,604 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 15:39:48,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:48,605 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:39:48,605 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:39:48,606 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:39:48,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:48,608 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 15:39:48,628 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:39:48,628 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:39:48,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:39:48,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:39:48,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:39:49,008 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 15:39:49,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:39:49,195 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 15:39:49,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:39:49,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 15:39:49,221 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:39:49,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:39:49,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:39:49,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:39:49,222 INFO L87 Difference]: Start difference. First operand 2693 states and 3316 transitions. Second operand 7 states. [2018-12-03 15:39:50,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:50,470 INFO L93 Difference]: Finished difference Result 5825 states and 7170 transitions. [2018-12-03 15:39:50,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:39:50,471 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2018-12-03 15:39:50,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:50,489 INFO L225 Difference]: With dead ends: 5825 [2018-12-03 15:39:50,490 INFO L226 Difference]: Without dead ends: 3135 [2018-12-03 15:39:50,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:39:50,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-12-03 15:39:50,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-12-03 15:39:50,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-12-03 15:39:50,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-12-03 15:39:50,977 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 66 [2018-12-03 15:39:50,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:50,977 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-12-03 15:39:50,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:39:50,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-12-03 15:39:50,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 15:39:50,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:50,982 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 15:39:50,983 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:50,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:50,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1417215583, now seen corresponding path program 3 times [2018-12-03 15:39:50,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:50,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:50,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:39:50,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:50,985 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:51,137 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 15:39:51,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:51,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:39:51,138 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:51,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:51,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:51,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:51,139 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-12-03 15:39:51,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:51,801 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-12-03 15:39:51,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:51,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-03 15:39:51,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:51,812 INFO L225 Difference]: With dead ends: 4873 [2018-12-03 15:39:51,813 INFO L226 Difference]: Without dead ends: 2215 [2018-12-03 15:39:51,817 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 15:39:51,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-12-03 15:39:52,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-12-03 15:39:52,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-12-03 15:39:52,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-12-03 15:39:52,159 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-12-03 15:39:52,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:52,160 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-12-03 15:39:52,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:52,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-12-03 15:39:52,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 15:39:52,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:52,163 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 15:39:52,163 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:52,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:52,163 INFO L82 PathProgramCache]: Analyzing trace with hash 79784675, now seen corresponding path program 4 times [2018-12-03 15:39:52,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:52,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:52,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:39:52,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:52,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:52,242 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 15:39:52,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:52,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:39:52,243 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:52,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:52,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:52,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:52,244 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-12-03 15:39:52,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:52,285 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-12-03 15:39:52,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:52,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-03 15:39:52,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:52,285 INFO L225 Difference]: With dead ends: 1799 [2018-12-03 15:39:52,285 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:39:52,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:52,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:39:52,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:39:52,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:39:52,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:39:52,289 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-12-03 15:39:52,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:52,289 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:39:52,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:52,289 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:39:52,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:39:52,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:39:52,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,500 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 50 [2018-12-03 15:39:52,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,845 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 306 DAG size of output: 52 [2018-12-03 15:39:52,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,951 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 46 [2018-12-03 15:39:52,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:52,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:53,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:54,348 WARN L180 SmtUtils]: Spent 799.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-12-03 15:39:55,205 WARN L180 SmtUtils]: Spent 855.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-12-03 15:39:55,413 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-12-03 15:39:55,867 WARN L180 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2018-12-03 15:39:55,993 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2018-12-03 15:39:56,198 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-12-03 15:39:56,339 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2018-12-03 15:39:56,539 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-12-03 15:39:56,847 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2018-12-03 15:39:56,850 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 15:39:56,850 INFO L444 ceAbstractionStarter]: At program point L535(lines 535 542) the Hoare annotation is: false [2018-12-03 15:39:56,851 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 15:39:56,851 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 15:39:56,851 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 15:39:56,851 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 544) no Hoare annotation was computed. [2018-12-03 15:39:56,851 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 544) no Hoare annotation was computed. [2018-12-03 15:39:56,851 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 15:39:56,851 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 15:39:56,852 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 15:39:56,852 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 544) no Hoare annotation was computed. [2018-12-03 15:39:56,852 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 15:39:56,852 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 15:39:56,852 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 15:39:56,853 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 15:39:56,853 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 15:39:56,853 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 15:39:56,853 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 15:39:56,853 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 15:39:56,854 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 15:39:56,854 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 543) no Hoare annotation was computed. [2018-12-03 15:39:56,879 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 03:39:56 BoogieIcfgContainer [2018-12-03 15:39:56,879 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:39:56,880 INFO L168 Benchmark]: Toolchain (without parser) took 18463.69 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -302.1 MB). Peak memory consumption was 784.2 MB. Max. memory is 7.1 GB. [2018-12-03 15:39:56,881 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:39:56,882 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:39:56,883 INFO L168 Benchmark]: Boogie Preprocessor took 49.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:39:56,883 INFO L168 Benchmark]: RCFGBuilder took 914.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-12-03 15:39:56,884 INFO L168 Benchmark]: TraceAbstraction took 17437.23 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -344.4 MB). Peak memory consumption was 741.9 MB. Max. memory is 7.1 GB. [2018-12-03 15:39:56,888 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 914.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17437.23 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -344.4 MB). Peak memory consumption was 741.9 MB. 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, 17.3s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 3.9s AutomataDifference, 0.0s DeadEndRemovalTime, 4.5s 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, 1.8s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s 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, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 524 NumberOfCodeBlocks, 492 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 608 ConstructedInterpolants, 18 QuantifiedInterpolants, 213012 SizeOfPredicates, 13 NumberOfNonLiveVariables, 700 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 450/576 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...