java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:55:50,671 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:55:50,675 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:55:50,694 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:55:50,695 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:55:50,696 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:55:50,697 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:55:50,699 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:55:50,709 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:55:50,710 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:55:50,711 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:55:50,711 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:55:50,712 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:55:50,713 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:55:50,714 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:55:50,715 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:55:50,716 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:55:50,718 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:55:50,720 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:55:50,721 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:55:50,723 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:55:50,724 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:55:50,727 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:55:50,727 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:55:50,727 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:55:50,731 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:55:50,732 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:55:50,733 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:55:50,735 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:55:50,736 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:55:50,738 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:55:50,739 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:55:50,739 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:55:50,739 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:55:50,742 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:55:50,742 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:55:50,743 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:55:50,766 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:55:50,766 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:55:50,770 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:55:50,771 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:55:50,771 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:55:50,771 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:55:50,771 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:55:50,772 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:55:50,772 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:55:50,772 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:55:50,772 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:55:50,772 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:55:50,773 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:55:50,774 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:55:50,774 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:55:50,774 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:55:50,774 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:55:50,776 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:55:50,776 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:55:50,776 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:55:50,777 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:55:50,777 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:55:50,777 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:55:50,777 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:55:50,777 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:55:50,778 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:55:50,778 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:55:50,778 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:55:50,779 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:55:50,779 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:55:50,779 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:55:50,779 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:55:50,780 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:55:50,780 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:55:50,781 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:55:50,781 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:55:50,781 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:55:50,781 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:55:50,781 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:55:50,834 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:55:50,849 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:55:50,856 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:55:50,857 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:55:50,858 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:55:50,859 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.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-12-03 17:55:50,859 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl' [2018-12-03 17:55:50,954 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:55:50,956 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:55:50,957 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:55:50,957 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:55:50,957 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:55:50,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:50" (1/1) ... [2018-12-03 17:55:50,993 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:50" (1/1) ... [2018-12-03 17:55:51,004 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:55:51,005 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:55:51,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:55:51,005 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:55:51,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:50" (1/1) ... [2018-12-03 17:55:51,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:50" (1/1) ... [2018-12-03 17:55:51,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:50" (1/1) ... [2018-12-03 17:55:51,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:50" (1/1) ... [2018-12-03 17:55:51,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:50" (1/1) ... [2018-12-03 17:55:51,064 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:50" (1/1) ... [2018-12-03 17:55:51,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:50" (1/1) ... [2018-12-03 17:55:51,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:55:51,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:55:51,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:55:51,073 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:55:51,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:55:51,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:55:51,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:55:51,906 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:55:51,907 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 17:55:51,907 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:55:51 BoogieIcfgContainer [2018-12-03 17:55:51,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:55:51,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:55:51,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:55:51,912 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:55:51,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:50" (1/2) ... [2018-12-03 17:55:51,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ac8aca and model type pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:55:51, skipping insertion in model container [2018-12-03 17:55:51,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:55:51" (2/2) ... [2018-12-03 17:55:51,916 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-12-03 17:55:51,926 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:55:51,936 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:55:51,954 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:55:51,991 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:55:51,991 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:55:51,992 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:55:51,992 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:55:51,992 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:55:51,992 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:55:51,992 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:55:51,995 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:55:52,012 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-12-03 17:55:52,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:55:52,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:55:52,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 17:55:52,023 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:55:52,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:55:52,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-12-03 17:55:52,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:55:52,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:52,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:55:52,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:52,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:55:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:55:52,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:55:52,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:55:52,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:55:52,282 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:55:52,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:55:52,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:55:52,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:55:52,305 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-12-03 17:55:52,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:55:52,362 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-12-03 17:55:52,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:55:52,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 17:55:52,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:55:52,376 INFO L225 Difference]: With dead ends: 57 [2018-12-03 17:55:52,377 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 17:55:52,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:55:52,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 17:55:52,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-12-03 17:55:52,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 17:55:52,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-12-03 17:55:52,437 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-12-03 17:55:52,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:55:52,437 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-12-03 17:55:52,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:55:52,438 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-12-03 17:55:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:55:52,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:55:52,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:55:52,439 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:55:52,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:55:52,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-12-03 17:55:52,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:55:52,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:52,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:55:52,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:52,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:55:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:55:52,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:55:52,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:55:52,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:55:52,622 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:55:52,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:55:52,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:55:52,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:55:52,625 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-12-03 17:55:52,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:55:52,686 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-12-03 17:55:52,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:55:52,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 17:55:52,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:55:52,690 INFO L225 Difference]: With dead ends: 103 [2018-12-03 17:55:52,690 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 17:55:52,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:55:52,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 17:55:52,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-12-03 17:55:52,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 17:55:52,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-12-03 17:55:52,712 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-12-03 17:55:52,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:55:52,712 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-12-03 17:55:52,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:55:52,713 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-12-03 17:55:52,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:55:52,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:55:52,714 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:55:52,714 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:55:52,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:55:52,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-12-03 17:55:52,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:55:52,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:52,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:55:52,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:52,718 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:55:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:55:52,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:55:52,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:55:52,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:55:52,875 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:55:52,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:55:52,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:55:52,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:55:52,877 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-12-03 17:55:53,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:55:53,063 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-12-03 17:55:53,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:55:53,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-03 17:55:53,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:55:53,076 INFO L225 Difference]: With dead ends: 141 [2018-12-03 17:55:53,076 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 17:55:53,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:55:53,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 17:55:53,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-12-03 17:55:53,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 17:55:53,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-12-03 17:55:53,121 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-12-03 17:55:53,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:55:53,121 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-12-03 17:55:53,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:55:53,122 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-12-03 17:55:53,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:55:53,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:55:53,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:55:53,123 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:55:53,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:55:53,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-12-03 17:55:53,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:55:53,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:53,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:55:53,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:53,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:55:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:55:53,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:55:53,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:55:53,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:55:53,240 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:55:53,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:55:53,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:55:53,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:55:53,242 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-12-03 17:55:53,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:55:53,348 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-12-03 17:55:53,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:55:53,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 17:55:53,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:55:53,353 INFO L225 Difference]: With dead ends: 183 [2018-12-03 17:55:53,356 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 17:55:53,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:55:53,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 17:55:53,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 17:55:53,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 17:55:53,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-12-03 17:55:53,401 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-12-03 17:55:53,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:55:53,405 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-12-03 17:55:53,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:55:53,405 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-12-03 17:55:53,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 17:55:53,407 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:55:53,408 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:55:53,408 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:55:53,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:55:53,408 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-12-03 17:55:53,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:55:53,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:53,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:55:53,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:53,411 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:55:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:55:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:55:53,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:55:53,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:55:53,598 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:55:53,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:55:53,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:55:53,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:55:53,599 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-12-03 17:55:53,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:55:53,665 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-12-03 17:55:53,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:55:53,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 17:55:53,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:55:53,668 INFO L225 Difference]: With dead ends: 321 [2018-12-03 17:55:53,669 INFO L226 Difference]: Without dead ends: 215 [2018-12-03 17:55:53,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:55:53,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-03 17:55:53,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-12-03 17:55:53,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-03 17:55:53,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-12-03 17:55:53,714 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-12-03 17:55:53,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:55:53,715 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-12-03 17:55:53,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:55:53,715 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-12-03 17:55:53,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 17:55:53,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:55:53,717 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:55:53,718 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:55:53,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:55:53,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-12-03 17:55:53,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:55:53,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:53,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:55:53,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:53,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:55:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:55:54,070 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 17:55:54,077 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:55:54,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:55:54,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:55:54,078 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:55:54,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:55:54,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:55:54,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:55:54,082 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-12-03 17:55:54,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:55:54,222 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-12-03 17:55:54,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:55:54,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 17:55:54,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:55:54,226 INFO L225 Difference]: With dead ends: 633 [2018-12-03 17:55:54,226 INFO L226 Difference]: Without dead ends: 423 [2018-12-03 17:55:54,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:55:54,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-12-03 17:55:54,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-12-03 17:55:54,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-03 17:55:54,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-12-03 17:55:54,321 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-12-03 17:55:54,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:55:54,321 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-12-03 17:55:54,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:55:54,322 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-12-03 17:55:54,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 17:55:54,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:55:54,329 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:55:54,329 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:55:54,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:55:54,329 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-12-03 17:55:54,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:55:54,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:54,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:55:54,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:54,333 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:55:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:55:54,599 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 17:55:54,603 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:55:54,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:55:54,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:55:54,604 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:55:54,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:55:54,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:55:54,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:55:54,606 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-12-03 17:55:54,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:55:54,799 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-12-03 17:55:54,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:55:54,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 17:55:54,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:55:54,805 INFO L225 Difference]: With dead ends: 1257 [2018-12-03 17:55:54,805 INFO L226 Difference]: Without dead ends: 839 [2018-12-03 17:55:54,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:55:54,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-12-03 17:55:54,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-12-03 17:55:54,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-12-03 17:55:54,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-12-03 17:55:54,934 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-12-03 17:55:54,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:55:54,935 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-12-03 17:55:54,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:55:54,935 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-12-03 17:55:54,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 17:55:54,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:55:54,938 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:55:54,938 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:55:54,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:55:54,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-12-03 17:55:54,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:55:54,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:54,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:55:54,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:54,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:55:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:55:55,213 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 17:55:55,218 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:55:55,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:55:55,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:55:55,218 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:55:55,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:55:55,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:55:55,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:55:55,220 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-12-03 17:55:55,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:55:55,551 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-12-03 17:55:55,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:55:55,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 17:55:55,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:55:55,562 INFO L225 Difference]: With dead ends: 2505 [2018-12-03 17:55:55,563 INFO L226 Difference]: Without dead ends: 1671 [2018-12-03 17:55:55,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:55:55,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-12-03 17:55:55,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-12-03 17:55:55,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-12-03 17:55:55,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-12-03 17:55:55,821 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-12-03 17:55:55,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:55:55,821 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-12-03 17:55:55,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:55:55,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-12-03 17:55:55,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 17:55:55,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:55:55,825 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:55:55,825 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:55:55,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:55:55,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-12-03 17:55:55,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:55:55,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:55,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:55:55,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:55,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:55:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:55:56,046 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-12-03 17:55:56,069 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:55:56,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:55:56,069 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:55:56,071 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-12-03 17:55:56,073 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50], [54], [56], [58], [62], [64], [66] [2018-12-03 17:55:56,142 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:55:56,143 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:55:58,143 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 17:56:59,883 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:56:59,885 INFO L272 AbstractInterpreter]: Visited 26 different actions 292 times. Merged at 25 different actions 201 times. Widened at 10 different actions 56 times. Found 64 fixpoints after 17 different actions. Largest state had 0 variables. [2018-12-03 17:56:59,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:59,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:56:59,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:56:59,899 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:56:59,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:59,912 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:56:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:57:00,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:57:00,321 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:57:00,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:57:00,681 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:57:00,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:57:00,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2018-12-03 17:57:00,716 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:57:00,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:57:00,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:57:00,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:57:00,719 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-12-03 17:57:00,956 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 17:57:01,296 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 17:57:01,852 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 17:57:02,280 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-03 17:57:02,663 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-03 17:57:04,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:57:04,690 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-12-03 17:57:04,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:57:04,690 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-12-03 17:57:04,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:57:04,706 INFO L225 Difference]: With dead ends: 4801 [2018-12-03 17:57:04,706 INFO L226 Difference]: Without dead ends: 3135 [2018-12-03 17:57:04,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:57:04,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-12-03 17:57:05,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-12-03 17:57:05,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-12-03 17:57:05,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-12-03 17:57:05,141 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-12-03 17:57:05,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:57:05,141 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-12-03 17:57:05,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:57:05,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-12-03 17:57:05,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 17:57:05,147 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:57:05,147 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:57:05,148 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:57:05,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:57:05,149 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-12-03 17:57:05,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:57:05,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:57:05,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:57:05,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:57:05,152 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:57:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:57:05,320 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 17:57:05,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:57:05,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:57:05,321 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:57:05,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:57:05,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:57:05,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:57:05,322 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-12-03 17:57:05,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:57:05,780 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-12-03 17:57:05,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:57:05,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-03 17:57:05,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:57:05,791 INFO L225 Difference]: With dead ends: 4873 [2018-12-03 17:57:05,791 INFO L226 Difference]: Without dead ends: 2215 [2018-12-03 17:57:05,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:57:05,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-12-03 17:57:06,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-12-03 17:57:06,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-12-03 17:57:06,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-12-03 17:57:06,127 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-12-03 17:57:06,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:57:06,128 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-12-03 17:57:06,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:57:06,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-12-03 17:57:06,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 17:57:06,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:57:06,130 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 17:57:06,131 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:57:06,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:57:06,131 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-12-03 17:57:06,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:57:06,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:57:06,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:57:06,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:57:06,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:57:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:57:06,222 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-03 17:57:06,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:57:06,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:57:06,224 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:57:06,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:57:06,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:57:06,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:57:06,225 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-12-03 17:57:06,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:57:06,265 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-12-03 17:57:06,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:57:06,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-03 17:57:06,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:57:06,266 INFO L225 Difference]: With dead ends: 1799 [2018-12-03 17:57:06,266 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 17:57:06,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:57:06,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 17:57:06,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 17:57:06,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 17:57:06,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 17:57:06,270 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-12-03 17:57:06,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:57:06,270 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 17:57:06,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:57:06,270 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 17:57:06,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 17:57:06,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 17:57:06,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,460 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 40 [2018-12-03 17:57:06,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,748 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 48 [2018-12-03 17:57:06,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:06,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,016 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 42 [2018-12-03 17:57:07,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,461 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 48 [2018-12-03 17:57:07,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:07,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:57:08,743 WARN L180 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2018-12-03 17:57:09,436 WARN L180 SmtUtils]: Spent 691.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 17:57:09,814 WARN L180 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 17:57:09,990 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 17:57:10,186 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-12-03 17:57:10,334 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 17:57:10,448 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2018-12-03 17:57:10,652 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 17:57:10,795 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 17:57:11,005 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 17:57:11,171 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-12-03 17:57:11,291 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-12-03 17:57:11,416 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 17:57:11,420 INFO L444 ceAbstractionStarter]: At program point L411(lines 402 412) the Hoare annotation is: (let ((.cse8 (div ~mode3 256))) (let ((.cse0 (= ~mode3 (* 256 .cse8))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~send2 127)) (.cse4 (< 0 (+ (div ~send2 256) 1))) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7) (and (and (not (= ~p2_old ~nomsg)) .cse2 .cse4 .cse6) (<= 1 ~mode3) (<= .cse8 0)) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse7)))) [2018-12-03 17:57:11,420 INFO L444 ceAbstractionStarter]: At program point L539(lines 364 539) the Hoare annotation is: (let ((.cse4 (div ~mode3 256)) (.cse0 (<= ~send2 127)) (.cse2 (div ~mode2 256)) (.cse1 (< 0 (+ (div ~send2 256) 1))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) (<= 1 ~mode3) .cse3 (<= .cse4 0)) (and (= ~mode3 (* 256 .cse4)) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 .cse2)) .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-12-03 17:57:11,420 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-12-03 17:57:11,421 INFO L444 ceAbstractionStarter]: At program point L436(lines 436 446) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (<= (div ~mode3 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse2 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse2 1)) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-12-03 17:57:11,421 INFO L444 ceAbstractionStarter]: At program point L416(lines 416 426) the Hoare annotation is: (let ((.cse8 (div ~mode3 256))) (let ((.cse0 (= ~mode3 (* 256 .cse8))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~send2 127)) (.cse4 (< 0 (+ (div ~send2 256) 1))) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7) (and (and (not (= ~p2_old ~nomsg)) .cse2 .cse4 .cse6) (<= 1 ~mode3) (<= .cse8 0)) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse7)))) [2018-12-03 17:57:11,421 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-12-03 17:57:11,421 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-12-03 17:57:11,421 INFO L444 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-12-03 17:57:11,422 INFO L444 ceAbstractionStarter]: At program point L371(lines 371 383) the Hoare annotation is: (let ((.cse4 (div ~mode3 256)) (.cse0 (<= ~send2 127)) (.cse2 (div ~mode2 256)) (.cse1 (< 0 (+ (div ~send2 256) 1))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) (<= 1 ~mode3) .cse3 (<= .cse4 0)) (and (= ~mode3 (* 256 .cse4)) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 .cse2)) .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-12-03 17:57:11,422 INFO L444 ceAbstractionStarter]: At program point L491(lines 485 492) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (<= (div ~mode3 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse2 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse2 1)) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-12-03 17:57:11,422 INFO L444 ceAbstractionStarter]: At program point L520(lines 515 521) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= 1 ULTIMATE.start_check_~tmp~159) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= (div ~mode3 256) 0)) [2018-12-03 17:57:11,422 INFO L444 ceAbstractionStarter]: At program point L388(lines 382 389) the Hoare annotation is: (let ((.cse2 (div ~mode2 256)) (.cse4 (div ~mode3 256)) (.cse0 (<= ~send2 127)) (.cse1 (< 0 (+ (div ~send2 256) 1))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) (<= 1 ~mode3) .cse3 (<= .cse4 0)) (and (= ~mode2 (* 256 .cse2)) (and (= ~mode3 (* 256 .cse4)) .cse0 .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256))))))) [2018-12-03 17:57:11,423 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-12-03 17:57:11,423 INFO L444 ceAbstractionStarter]: At program point L471(lines 464 472) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (<= (div ~mode3 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse2 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse2 1)) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-12-03 17:57:11,424 INFO L444 ceAbstractionStarter]: At program point L393(lines 393 403) the Hoare annotation is: (let ((.cse2 (div ~mode2 256)) (.cse4 (div ~mode3 256)) (.cse0 (<= ~send2 127)) (.cse1 (< 0 (+ (div ~send2 256) 1))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) (<= 1 ~mode3) .cse3 (<= .cse4 0)) (and (= ~mode2 (* 256 .cse2)) (and (= ~mode3 (* 256 .cse4)) .cse0 .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256))))))) [2018-12-03 17:57:11,424 INFO L444 ceAbstractionStarter]: At program point L451(lines 445 452) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (<= (div ~mode3 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse2 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse2 1)) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-12-03 17:57:11,424 INFO L444 ceAbstractionStarter]: At program point L509(lines 509 516) the Hoare annotation is: (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse6 (<= (div ~mode3 256) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse3 .cse4 .cse5 .cse7 .cse6))) [2018-12-03 17:57:11,424 INFO L444 ceAbstractionStarter]: At program point L476(lines 476 486) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (<= (div ~mode3 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse2 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse2 1)) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-12-03 17:57:11,425 INFO L444 ceAbstractionStarter]: At program point L530(lines 530 537) the Hoare annotation is: (and (= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= 1 ULTIMATE.start_check_~tmp~159) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= (div ~mode3 256) 0)) [2018-12-03 17:57:11,425 INFO L444 ceAbstractionStarter]: At program point L431(lines 425 432) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (<= (div ~mode3 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse2 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse2 1)) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-12-03 17:57:11,425 INFO L444 ceAbstractionStarter]: At program point L456(lines 456 465) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (<= (div ~mode3 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse2 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse2 1)) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-12-03 17:57:11,452 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:57:11 BoogieIcfgContainer [2018-12-03 17:57:11,453 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 17:57:11,454 INFO L168 Benchmark]: Toolchain (without parser) took 80499.01 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 779.7 MB. Max. memory is 7.1 GB. [2018-12-03 17:57:11,455 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:57:11,455 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:57:11,456 INFO L168 Benchmark]: Boogie Preprocessor took 67.40 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:57:11,457 INFO L168 Benchmark]: RCFGBuilder took 834.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-12-03 17:57:11,457 INFO L168 Benchmark]: TraceAbstraction took 79544.17 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 726.9 MB. Max. memory is 7.1 GB. [2018-12-03 17:57:11,462 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 67.40 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 834.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 79544.17 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 726.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 541]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 382]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || (~mode2 == 256 * (~mode2 / 256) && (((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 445]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 464]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 485]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || (((((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && 1 <= ~mode3) && ~mode3 / 256 <= 0)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 436]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || (~mode2 == 256 * (~mode2 / 256) && (((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && 1 <= check_~tmp~159) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0 - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: ((((((((assert_~arg == 1 && !(~p2_old == ~nomsg)) && 1 <= ~mode2) && 1 <= check_~tmp~159) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0 - InvariantResult [Line: 476]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 364]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 402]: Loop Invariant Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || (((((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && 1 <= ~mode3) && ~mode3 / 256 <= 0)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 425]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 79.4s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 5.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2101occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 63.8s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1528 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 1388 HoareAnnotationTreeSize, 17 FomulaSimplifications, 81143 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 17 FomulaSimplificationsInter, 200 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 429 ConstructedInterpolants, 12 QuantifiedInterpolants, 63939 SizeOfPredicates, 1 NumberOfNonLiveVariables, 347 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 274/304 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...