java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:42:35,747 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:42:35,750 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:42:35,763 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:42:35,764 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:42:35,765 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:42:35,766 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:42:35,768 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:42:35,770 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:42:35,773 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:42:35,774 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:42:35,774 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:42:35,775 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:42:35,779 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:42:35,786 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:42:35,787 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:42:35,791 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:42:35,794 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:42:35,798 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:42:35,801 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:42:35,803 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:42:35,805 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:42:35,810 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:42:35,810 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:42:35,810 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:42:35,811 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:42:35,812 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:42:35,815 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:42:35,817 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:42:35,819 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:42:35,820 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:42:35,821 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:42:35,822 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:42:35,822 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:42:35,823 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:42:35,825 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:42:35,825 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:42:35,847 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:42:35,848 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:42:35,849 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:42:35,849 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:42:35,849 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:42:35,849 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:42:35,850 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:42:35,850 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:42:35,850 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:42:35,850 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:42:35,850 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:42:35,851 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:42:35,851 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:42:35,851 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:42:35,851 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:42:35,852 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:42:35,852 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:42:35,852 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:42:35,853 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:42:35,853 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:42:35,853 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:42:35,853 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:42:35,854 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:42:35,854 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:42:35,854 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:42:35,854 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:42:35,854 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:42:35,855 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:42:35,855 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:42:35,855 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:42:35,855 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:42:35,855 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:42:35,856 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:42:35,856 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:42:35,856 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:42:35,856 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:42:35,857 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:42:35,857 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:42:35,857 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:42:35,857 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:42:35,857 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:42:35,911 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:42:35,927 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:42:35,932 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:42:35,935 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:42:35,936 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:42:35,937 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl [2018-12-03 16:42:35,937 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl' [2018-12-03 16:42:36,035 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:42:36,037 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:42:36,038 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:42:36,038 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:42:36,039 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:42:36,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:36" (1/1) ... [2018-12-03 16:42:36,081 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:36" (1/1) ... [2018-12-03 16:42:36,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:42:36,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:42:36,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:42:36,095 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:42:36,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:36" (1/1) ... [2018-12-03 16:42:36,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:36" (1/1) ... [2018-12-03 16:42:36,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:36" (1/1) ... [2018-12-03 16:42:36,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:36" (1/1) ... [2018-12-03 16:42:36,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:36" (1/1) ... [2018-12-03 16:42:36,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:36" (1/1) ... [2018-12-03 16:42:36,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:36" (1/1) ... [2018-12-03 16:42:36,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:42:36,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:42:36,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:42:36,144 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:42:36,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:42:36,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:42:36,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:42:37,017 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:42:37,018 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:42:37,018 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:42:37 BoogieIcfgContainer [2018-12-03 16:42:37,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:42:37,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:42:37,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:42:37,023 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:42:37,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:36" (1/2) ... [2018-12-03 16:42:37,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66db61e3 and model type pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:42:37, skipping insertion in model container [2018-12-03 16:42:37,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:42:37" (2/2) ... [2018-12-03 16:42:37,027 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl [2018-12-03 16:42:37,038 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:42:37,046 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:42:37,065 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:42:37,101 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:42:37,102 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:42:37,102 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:42:37,102 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:42:37,102 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:42:37,102 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:42:37,103 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:42:37,103 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:42:37,123 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-12-03 16:42:37,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:42:37,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:37,134 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:37,137 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:37,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:37,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-12-03 16:42:37,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:37,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:37,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:37,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:37,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:37,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:37,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:37,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:37,413 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:37,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:37,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:37,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:37,438 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-12-03 16:42:37,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:37,515 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-12-03 16:42:37,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:37,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 16:42:37,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:37,529 INFO L225 Difference]: With dead ends: 57 [2018-12-03 16:42:37,530 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:42:37,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:37,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:42:37,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-12-03 16:42:37,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 16:42:37,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-12-03 16:42:37,582 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-12-03 16:42:37,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:37,583 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-12-03 16:42:37,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:37,583 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-12-03 16:42:37,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:42:37,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:37,584 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:37,585 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:37,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:37,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-12-03 16:42:37,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:37,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:37,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:37,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:37,589 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:37,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:37,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:37,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:37,764 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:37,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:37,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:37,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:37,767 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-12-03 16:42:37,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:37,839 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-12-03 16:42:37,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:37,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 16:42:37,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:37,842 INFO L225 Difference]: With dead ends: 103 [2018-12-03 16:42:37,842 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 16:42:37,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:37,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 16:42:37,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-12-03 16:42:37,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 16:42:37,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-12-03 16:42:37,878 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-12-03 16:42:37,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:37,879 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-12-03 16:42:37,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:37,879 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-12-03 16:42:37,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:42:37,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:37,880 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:37,880 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:37,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:37,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-12-03 16:42:37,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:37,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:37,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:37,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:37,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:38,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:38,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:38,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:38,049 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:38,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:38,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:38,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:38,053 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 3 states. [2018-12-03 16:42:38,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:38,127 INFO L93 Difference]: Finished difference Result 199 states and 280 transitions. [2018-12-03 16:42:38,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:38,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 16:42:38,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:38,132 INFO L225 Difference]: With dead ends: 199 [2018-12-03 16:42:38,132 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 16:42:38,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:38,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 16:42:38,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-12-03 16:42:38,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-03 16:42:38,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 182 transitions. [2018-12-03 16:42:38,168 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 182 transitions. Word has length 18 [2018-12-03 16:42:38,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:38,168 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 182 transitions. [2018-12-03 16:42:38,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:38,169 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 182 transitions. [2018-12-03 16:42:38,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:42:38,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:38,170 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:38,170 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:38,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:38,170 INFO L82 PathProgramCache]: Analyzing trace with hash 823143127, now seen corresponding path program 1 times [2018-12-03 16:42:38,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:38,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:38,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:38,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:38,173 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:38,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:38,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:38,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:42:38,325 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:38,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:42:38,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:42:38,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:42:38,327 INFO L87 Difference]: Start difference. First operand 131 states and 182 transitions. Second operand 4 states. [2018-12-03 16:42:38,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:38,536 INFO L93 Difference]: Finished difference Result 277 states and 379 transitions. [2018-12-03 16:42:38,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:42:38,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-03 16:42:38,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:38,543 INFO L225 Difference]: With dead ends: 277 [2018-12-03 16:42:38,543 INFO L226 Difference]: Without dead ends: 275 [2018-12-03 16:42:38,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:42:38,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-12-03 16:42:38,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 147. [2018-12-03 16:42:38,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-03 16:42:38,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 198 transitions. [2018-12-03 16:42:38,615 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 198 transitions. Word has length 18 [2018-12-03 16:42:38,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:38,615 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 198 transitions. [2018-12-03 16:42:38,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:42:38,617 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 198 transitions. [2018-12-03 16:42:38,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:42:38,618 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:38,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:38,619 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:38,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:38,619 INFO L82 PathProgramCache]: Analyzing trace with hash 823202709, now seen corresponding path program 1 times [2018-12-03 16:42:38,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:38,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:38,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:38,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:38,622 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:38,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:38,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:38,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:38,739 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:38,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:38,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:38,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:38,740 INFO L87 Difference]: Start difference. First operand 147 states and 198 transitions. Second operand 3 states. [2018-12-03 16:42:38,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:38,844 INFO L93 Difference]: Finished difference Result 359 states and 485 transitions. [2018-12-03 16:42:38,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:38,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 16:42:38,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:38,853 INFO L225 Difference]: With dead ends: 359 [2018-12-03 16:42:38,853 INFO L226 Difference]: Without dead ends: 213 [2018-12-03 16:42:38,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:38,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-12-03 16:42:38,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-12-03 16:42:38,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-03 16:42:38,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-12-03 16:42:38,909 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 18 [2018-12-03 16:42:38,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:38,909 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-12-03 16:42:38,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:38,909 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-12-03 16:42:38,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:42:38,911 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:38,911 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:38,912 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:38,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:38,912 INFO L82 PathProgramCache]: Analyzing trace with hash 748385901, now seen corresponding path program 1 times [2018-12-03 16:42:38,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:38,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:38,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:38,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:38,915 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:39,263 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 16:42:39,268 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:39,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:39,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:39,269 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:39,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:39,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:39,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:39,271 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-12-03 16:42:39,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:39,419 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-12-03 16:42:39,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:39,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 16:42:39,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:39,424 INFO L225 Difference]: With dead ends: 633 [2018-12-03 16:42:39,424 INFO L226 Difference]: Without dead ends: 423 [2018-12-03 16:42:39,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:39,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-12-03 16:42:39,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-12-03 16:42:39,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-03 16:42:39,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-12-03 16:42:39,509 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-12-03 16:42:39,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:39,512 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-12-03 16:42:39,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:39,513 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-12-03 16:42:39,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:42:39,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:39,519 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:39,520 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:39,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:39,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1759503151, now seen corresponding path program 1 times [2018-12-03 16:42:39,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:39,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:39,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:39,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:39,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:39,822 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 16:42:39,827 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:39,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:39,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:39,829 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:39,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:39,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:39,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:39,830 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-12-03 16:42:40,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:40,060 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-12-03 16:42:40,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:40,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 16:42:40,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:40,070 INFO L225 Difference]: With dead ends: 1257 [2018-12-03 16:42:40,070 INFO L226 Difference]: Without dead ends: 839 [2018-12-03 16:42:40,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:40,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-12-03 16:42:40,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-12-03 16:42:40,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-12-03 16:42:40,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-12-03 16:42:40,213 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-12-03 16:42:40,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:40,214 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-12-03 16:42:40,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:40,214 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-12-03 16:42:40,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:42:40,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:40,222 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:40,223 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:40,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:40,223 INFO L82 PathProgramCache]: Analyzing trace with hash -2142437135, now seen corresponding path program 1 times [2018-12-03 16:42:40,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:40,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:40,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:40,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:40,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:40,563 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 16:42:40,570 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:40,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:40,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:40,570 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:40,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:40,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:40,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:40,572 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-12-03 16:42:40,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:40,917 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-12-03 16:42:40,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:40,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 16:42:40,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:40,927 INFO L225 Difference]: With dead ends: 2505 [2018-12-03 16:42:40,927 INFO L226 Difference]: Without dead ends: 1671 [2018-12-03 16:42:40,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:40,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-12-03 16:42:41,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-12-03 16:42:41,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-12-03 16:42:41,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-12-03 16:42:41,185 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-12-03 16:42:41,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:41,186 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-12-03 16:42:41,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:41,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-12-03 16:42:41,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:42:41,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:41,189 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:41,190 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:41,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:41,190 INFO L82 PathProgramCache]: Analyzing trace with hash 2095271859, now seen corresponding path program 1 times [2018-12-03 16:42:41,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:41,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:41,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:41,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:41,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:41,380 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 16:42:41,476 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:42:41,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:41,476 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:42:41,477 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-12-03 16:42:41,479 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50], [54], [56], [58], [62], [64], [66] [2018-12-03 16:42:41,525 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:42:41,525 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:42:43,608 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:42:43,610 INFO L272 AbstractInterpreter]: Visited 26 different actions 234 times. Merged at 25 different actions 148 times. Widened at 14 different actions 15 times. Found 59 fixpoints after 15 different actions. Largest state had 0 variables. [2018-12-03 16:42:43,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:43,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:42:43,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:43,658 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:42:43,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:43,676 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:42:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:43,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:42:44,074 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-12-03 16:42:44,092 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:42:44,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:42:44,437 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:44,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:42:44,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 8 [2018-12-03 16:42:44,478 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:42:44,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:42:44,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:42:44,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:42:44,483 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 6 states. [2018-12-03 16:42:45,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:45,135 INFO L93 Difference]: Finished difference Result 3881 states and 4894 transitions. [2018-12-03 16:42:45,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:42:45,136 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-12-03 16:42:45,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:45,150 INFO L225 Difference]: With dead ends: 3881 [2018-12-03 16:42:45,150 INFO L226 Difference]: Without dead ends: 2727 [2018-12-03 16:42:45,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:42:45,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2018-12-03 16:42:45,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 2693. [2018-12-03 16:42:45,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2693 states. [2018-12-03 16:42:45,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 3316 transitions. [2018-12-03 16:42:45,588 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 3316 transitions. Word has length 34 [2018-12-03 16:42:45,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:45,588 INFO L480 AbstractCegarLoop]: Abstraction has 2693 states and 3316 transitions. [2018-12-03 16:42:45,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:42:45,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 3316 transitions. [2018-12-03 16:42:45,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 16:42:45,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:45,594 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 16:42:45,597 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:45,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:45,598 INFO L82 PathProgramCache]: Analyzing trace with hash -135466269, now seen corresponding path program 2 times [2018-12-03 16:42:45,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:45,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:45,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:45,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:45,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:45,998 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-12-03 16:42:46,242 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-12-03 16:42:46,306 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 16:42:46,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:46,307 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:42:46,307 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:42:46,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:42:46,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:46,307 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:42:46,318 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:42:46,319 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:42:46,410 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:42:46,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:42:46,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:42:46,770 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 19 [2018-12-03 16:42:47,027 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-03 16:42:47,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:42:47,265 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-03 16:42:47,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:42:47,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 16:42:47,294 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:42:47,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:42:47,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:42:47,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:42:47,295 INFO L87 Difference]: Start difference. First operand 2693 states and 3316 transitions. Second operand 7 states. [2018-12-03 16:42:48,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:48,661 INFO L93 Difference]: Finished difference Result 5825 states and 7170 transitions. [2018-12-03 16:42:48,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:42:48,661 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2018-12-03 16:42:48,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:48,676 INFO L225 Difference]: With dead ends: 5825 [2018-12-03 16:42:48,677 INFO L226 Difference]: Without dead ends: 3135 [2018-12-03 16:42:48,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:42:48,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-12-03 16:42:49,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-12-03 16:42:49,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-12-03 16:42:49,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-12-03 16:42:49,149 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 66 [2018-12-03 16:42:49,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:49,150 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-12-03 16:42:49,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:42:49,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-12-03 16:42:49,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 16:42:49,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:49,154 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 16:42:49,155 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:49,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:49,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1417215583, now seen corresponding path program 3 times [2018-12-03 16:42:49,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:49,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:49,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:42:49,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:49,157 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:49,464 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 16:42:49,473 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 16:42:49,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:49,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:49,473 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:49,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:49,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:49,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:49,475 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-12-03 16:42:50,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:50,211 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-12-03 16:42:50,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:50,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-03 16:42:50,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:50,222 INFO L225 Difference]: With dead ends: 4873 [2018-12-03 16:42:50,222 INFO L226 Difference]: Without dead ends: 2215 [2018-12-03 16:42:50,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:50,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-12-03 16:42:50,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-12-03 16:42:50,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-12-03 16:42:50,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-12-03 16:42:50,605 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-12-03 16:42:50,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:50,605 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-12-03 16:42:50,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:50,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-12-03 16:42:50,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 16:42:50,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:50,608 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 16:42:50,608 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:50,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:50,609 INFO L82 PathProgramCache]: Analyzing trace with hash 79784675, now seen corresponding path program 4 times [2018-12-03 16:42:50,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:50,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:50,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:42:50,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:50,610 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:50,684 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-03 16:42:50,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:50,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:50,685 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:50,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:50,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:50,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:50,686 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-12-03 16:42:50,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:50,725 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-12-03 16:42:50,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:50,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-03 16:42:50,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:50,726 INFO L225 Difference]: With dead ends: 1799 [2018-12-03 16:42:50,726 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:42:50,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:50,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:42:50,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:42:50,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:42:50,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:42:50,729 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-12-03 16:42:50,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:50,729 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:42:50,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:50,729 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:42:50,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:42:50,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:42:50,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,193 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 306 DAG size of output: 52 [2018-12-03 16:42:51,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:51,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:52,721 WARN L180 SmtUtils]: Spent 804.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-12-03 16:42:53,309 WARN L180 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-12-03 16:42:53,484 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-12-03 16:42:53,615 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2018-12-03 16:42:53,733 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2018-12-03 16:42:53,954 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2018-12-03 16:42:54,056 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2018-12-03 16:42:54,259 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-12-03 16:42:54,362 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2018-12-03 16:42:54,513 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-12-03 16:42:54,825 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2018-12-03 16:42:54,830 INFO L444 ceAbstractionStarter]: At program point L415(lines 415 425) the Hoare annotation is: (let ((.cse0 (div ~mode3 256)) (.cse2 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (= 0 (+ ~nomsg 1)))) (or (and (<= 1 ~mode3) (<= .cse0 0) (and (exists ((~send2 Int)) (let ((.cse1 (mod ~send2 256))) (and (= ~p2_old .cse1) (<= .cse1 127) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1))))) .cse2 .cse3 .cse4)) (and (exists ((~send2 Int)) (let ((.cse5 (mod ~send2 256))) (and (<= .cse5 127) (<= ~send2 127) (= ~p2_new .cse5) (< 0 (+ (div ~send2 256) 1))))) (= ~mode3 (* 256 .cse0)) (<= 1 ~mode2) (<= ~r1 1) .cse2 .cse3 (<= (div ~mode2 256) 0) .cse4))) [2018-12-03 16:42:54,830 INFO L444 ceAbstractionStarter]: At program point L535(lines 535 542) the Hoare annotation is: false [2018-12-03 16:42:54,830 INFO L444 ceAbstractionStarter]: At program point L490(lines 484 491) the Hoare annotation is: (and (exists ((~send2 Int)) (let ((.cse0 (mod ~send2 256))) (and (<= .cse0 127) (<= ~send2 127) (= ~p2_new .cse0) (< 0 (+ (div ~send2 256) 1))))) (<= 1 ~mode2) (<= ~r1 1) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (<= (div ~mode3 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 16:42:54,830 INFO L444 ceAbstractionStarter]: At program point L519(lines 514 520) the Hoare annotation is: (and (exists ((~send2 Int)) (let ((.cse0 (mod ~send2 256))) (and (= ~p2_old .cse0) (<= .cse0 127) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1))))) (<= 1 ULTIMATE.start_check_~tmp~156) (<= 1 ~mode2) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= (div ~mode3 256) 0)) [2018-12-03 16:42:54,830 INFO L444 ceAbstractionStarter]: At program point L387(lines 382 388) the Hoare annotation is: (let ((.cse5 (div ~mode3 256)) (.cse1 (<= ~send2 127)) (.cse2 (< 0 (+ (div ~send2 256) 1))) (.cse4 (= 0 (+ ~nomsg 1))) (.cse3 (div ~mode2 256))) (or (and (exists ((~send2 Int)) (let ((.cse0 (mod ~send2 256))) (and (= ~p2_old .cse0) (<= .cse0 127) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1))))) (<= 1 ~mode2) .cse1 .cse2 (<= .cse3 0) (<= 1 ~mode3) .cse4 (<= .cse5 0)) (and (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) (= ~mode3 (* 256 .cse5))) .cse1 .cse2 .cse4) (= ~mode2 (* 256 .cse3))))) [2018-12-03 16:42:54,830 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 544) no Hoare annotation was computed. [2018-12-03 16:42:54,831 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 544) no Hoare annotation was computed. [2018-12-03 16:42:54,831 INFO L444 ceAbstractionStarter]: At program point L470(lines 464 471) the Hoare annotation is: (and (exists ((~send2 Int)) (let ((.cse0 (mod ~send2 256))) (and (<= .cse0 127) (<= ~send2 127) (= ~p2_new .cse0) (< 0 (+ (div ~send2 256) 1))))) (<= 1 ~mode2) (<= ~r1 1) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (<= (div ~mode3 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 16:42:54,831 INFO L444 ceAbstractionStarter]: At program point L392(lines 392 402) the Hoare annotation is: (let ((.cse5 (div ~mode3 256)) (.cse1 (<= ~send2 127)) (.cse2 (< 0 (+ (div ~send2 256) 1))) (.cse4 (= 0 (+ ~nomsg 1))) (.cse3 (div ~mode2 256))) (or (and (exists ((~send2 Int)) (let ((.cse0 (mod ~send2 256))) (and (= ~p2_old .cse0) (<= .cse0 127) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1))))) (<= 1 ~mode2) .cse1 .cse2 (<= .cse3 0) (<= 1 ~mode3) .cse4 (<= .cse5 0)) (and (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) (= ~mode3 (* 256 .cse5))) .cse1 .cse2 .cse4) (= ~mode2 (* 256 .cse3))))) [2018-12-03 16:42:54,831 INFO L444 ceAbstractionStarter]: At program point L450(lines 444 451) the Hoare annotation is: (and (exists ((~send2 Int)) (let ((.cse0 (mod ~send2 256))) (and (<= .cse0 127) (<= ~send2 127) (= ~p2_new .cse0) (< 0 (+ (div ~send2 256) 1))))) (<= 1 ~mode2) (<= ~r1 1) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (<= (div ~mode3 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 16:42:54,831 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 544) no Hoare annotation was computed. [2018-12-03 16:42:54,831 INFO L444 ceAbstractionStarter]: At program point L541(lines 365 541) the Hoare annotation is: (let ((.cse5 (div ~mode3 256)) (.cse1 (<= ~send2 127)) (.cse3 (div ~mode2 256)) (.cse2 (< 0 (+ (div ~send2 256) 1))) (.cse4 (= 0 (+ ~nomsg 1)))) (or (and (exists ((~send2 Int)) (let ((.cse0 (mod ~send2 256))) (and (= ~p2_old .cse0) (<= .cse0 127) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1))))) (<= 1 ~mode2) .cse1 .cse2 (<= .cse3 0) (<= 1 ~mode3) .cse4 (<= .cse5 0)) (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) (= ~mode3 (* 256 .cse5)) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (= ~mode2 (* 256 .cse3)) .cse2 .cse4))) [2018-12-03 16:42:54,832 INFO L444 ceAbstractionStarter]: At program point L508(lines 508 515) the Hoare annotation is: (and (exists ((~send2 Int)) (let ((.cse0 (mod ~send2 256))) (and (= ~p2_old .cse0) (<= .cse0 127) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1))))) (<= 1 ~mode2) (<= ~r1 1) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (<= (div ~mode3 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 16:42:54,832 INFO L444 ceAbstractionStarter]: At program point L475(lines 475 485) the Hoare annotation is: (and (exists ((~send2 Int)) (let ((.cse0 (mod ~send2 256))) (and (<= .cse0 127) (<= ~send2 127) (= ~p2_new .cse0) (< 0 (+ (div ~send2 256) 1))))) (<= 1 ~mode2) (<= ~r1 1) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (<= (div ~mode3 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 16:42:54,832 INFO L444 ceAbstractionStarter]: At program point L372(lines 372 383) the Hoare annotation is: (let ((.cse5 (div ~mode3 256)) (.cse1 (<= ~send2 127)) (.cse3 (div ~mode2 256)) (.cse2 (< 0 (+ (div ~send2 256) 1))) (.cse4 (= 0 (+ ~nomsg 1)))) (or (and (exists ((~send2 Int)) (let ((.cse0 (mod ~send2 256))) (and (= ~p2_old .cse0) (<= .cse0 127) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1))))) (<= 1 ~mode2) .cse1 .cse2 (<= .cse3 0) (<= 1 ~mode3) .cse4 (<= .cse5 0)) (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) (= ~mode3 (* 256 .cse5)) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (= ~mode2 (* 256 .cse3)) .cse2 .cse4))) [2018-12-03 16:42:54,832 INFO L444 ceAbstractionStarter]: At program point L529(lines 529 536) the Hoare annotation is: (and (exists ((~send2 Int)) (let ((.cse0 (mod ~send2 256))) (and (= ~p2_old .cse0) (<= .cse0 127) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1))))) (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~156) (<= 1 ~mode2) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (<= (div ~mode3 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 16:42:54,832 INFO L444 ceAbstractionStarter]: At program point L430(lines 424 431) the Hoare annotation is: (and (exists ((~send2 Int)) (let ((.cse0 (mod ~send2 256))) (and (<= .cse0 127) (<= ~send2 127) (= ~p2_new .cse0) (< 0 (+ (div ~send2 256) 1))))) (<= 1 ~mode2) (<= ~r1 1) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (<= (div ~mode3 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 16:42:54,833 INFO L444 ceAbstractionStarter]: At program point L455(lines 455 465) the Hoare annotation is: (and (exists ((~send2 Int)) (let ((.cse0 (mod ~send2 256))) (and (<= .cse0 127) (<= ~send2 127) (= ~p2_new .cse0) (< 0 (+ (div ~send2 256) 1))))) (<= 1 ~mode2) (<= ~r1 1) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (<= (div ~mode3 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 16:42:54,833 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 543) no Hoare annotation was computed. [2018-12-03 16:42:54,833 INFO L444 ceAbstractionStarter]: At program point L410(lines 401 411) the Hoare annotation is: (let ((.cse0 (div ~mode3 256)) (.cse2 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (= 0 (+ ~nomsg 1)))) (or (and (<= 1 ~mode3) (<= .cse0 0) (and (exists ((~send2 Int)) (let ((.cse1 (mod ~send2 256))) (and (= ~p2_old .cse1) (<= .cse1 127) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1))))) .cse2 .cse3 .cse4)) (and (exists ((~send2 Int)) (let ((.cse5 (mod ~send2 256))) (and (<= .cse5 127) (<= ~send2 127) (= ~p2_new .cse5) (< 0 (+ (div ~send2 256) 1))))) (= ~mode3 (* 256 .cse0)) (<= 1 ~mode2) (<= ~r1 1) .cse2 .cse3 (<= (div ~mode2 256) 0) .cse4))) [2018-12-03 16:42:54,833 INFO L444 ceAbstractionStarter]: At program point L435(lines 435 445) the Hoare annotation is: (and (exists ((~send2 Int)) (let ((.cse0 (mod ~send2 256))) (and (<= .cse0 127) (<= ~send2 127) (= ~p2_new .cse0) (< 0 (+ (div ~send2 256) 1))))) (<= 1 ~mode2) (<= ~r1 1) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (<= (div ~mode3 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 16:42:54,856 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:42:54 BoogieIcfgContainer [2018-12-03 16:42:54,856 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:42:54,857 INFO L168 Benchmark]: Toolchain (without parser) took 18821.19 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 988.3 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -254.5 MB). Peak memory consumption was 733.8 MB. Max. memory is 7.1 GB. [2018-12-03 16:42:54,858 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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 16:42:54,859 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.65 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 16:42:54,859 INFO L168 Benchmark]: Boogie Preprocessor took 48.80 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 16:42:54,860 INFO L168 Benchmark]: RCFGBuilder took 875.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-12-03 16:42:54,861 INFO L168 Benchmark]: TraceAbstraction took 17836.73 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 988.3 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -307.3 MB). Peak memory consumption was 681.0 MB. Max. memory is 7.1 GB. [2018-12-03 16:42:54,865 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.20 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 55.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.80 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 875.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17836.73 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 988.3 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -307.3 MB). Peak memory consumption was 681.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 543]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 424]: Loop Invariant Derived loop invariant: ((((((((exists ~send2 : int :: ((~send2 % 256 <= 127 && ~send2 <= 127) && ~p2_new == ~send2 % 256) && 0 < ~send2 / 256 + 1) && 1 <= ~mode2) && ~r1 <= 1) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 382]: Loop Invariant Derived loop invariant: ((((((((exists ~send2 : int :: ((~p2_old == ~send2 % 256 && ~send2 % 256 <= 127) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~mode2 == 256 * (~mode2 / 256)) - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: ((((((((exists ~send2 : int :: ((~send2 % 256 <= 127 && ~send2 <= 127) && ~p2_new == ~send2 % 256) && 0 < ~send2 / 256 + 1) && 1 <= ~mode2) && ~r1 <= 1) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 535]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 464]: Loop Invariant Derived loop invariant: ((((((((exists ~send2 : int :: ((~send2 % 256 <= 127 && ~send2 <= 127) && ~p2_new == ~send2 % 256) && 0 < ~send2 / 256 + 1) && 1 <= ~mode2) && ~r1 <= 1) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 484]: Loop Invariant Derived loop invariant: ((((((((exists ~send2 : int :: ((~send2 % 256 <= 127 && ~send2 <= 127) && ~p2_new == ~send2 % 256) && 0 < ~send2 / 256 + 1) && 1 <= ~mode2) && ~r1 <= 1) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: ((1 <= ~mode3 && ~mode3 / 256 <= 0) && (((exists ~send2 : int :: ((~p2_old == ~send2 % 256 && ~send2 % 256 <= 127) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) || ((((((((exists ~send2 : int :: ((~send2 % 256 <= 127 && ~send2 <= 127) && ~p2_new == ~send2 % 256) && 0 < ~send2 / 256 + 1) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~r1 <= 1) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 372]: Loop Invariant Derived loop invariant: ((((((((exists ~send2 : int :: ((~p2_old == ~send2 % 256 && ~send2 % 256 <= 127) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || (((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: ((((((((exists ~send2 : int :: ((~send2 % 256 <= 127 && ~send2 <= 127) && ~p2_new == ~send2 % 256) && 0 < ~send2 / 256 + 1) && 1 <= ~mode2) && ~r1 <= 1) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 392]: Loop Invariant Derived loop invariant: ((((((((exists ~send2 : int :: ((~p2_old == ~send2 % 256 && ~send2 % 256 <= 127) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~mode2 == 256 * (~mode2 / 256)) - InvariantResult [Line: 365]: Loop Invariant Derived loop invariant: ((((((((exists ~send2 : int :: ((~p2_old == ~send2 % 256 && ~send2 % 256 <= 127) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || (((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) - InvariantResult [Line: 455]: Loop Invariant Derived loop invariant: ((((((((exists ~send2 : int :: ((~send2 % 256 <= 127 && ~send2 <= 127) && ~p2_new == ~send2 % 256) && 0 < ~send2 / 256 + 1) && 1 <= ~mode2) && ~r1 <= 1) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 514]: Loop Invariant Derived loop invariant: ((((((((exists ~send2 : int :: ((~p2_old == ~send2 % 256 && ~send2 % 256 <= 127) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 1 <= check_~tmp~156) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0 - InvariantResult [Line: 508]: Loop Invariant Derived loop invariant: ((((((((exists ~send2 : int :: ((~p2_old == ~send2 % 256 && ~send2 % 256 <= 127) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 1 <= ~mode2) && ~r1 <= 1) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 529]: Loop Invariant Derived loop invariant: (((((((((exists ~send2 : int :: ((~p2_old == ~send2 % 256 && ~send2 % 256 <= 127) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && assert_~arg == 1) && 1 <= check_~tmp~156) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 475]: Loop Invariant Derived loop invariant: ((((((((exists ~send2 : int :: ((~send2 % 256 <= 127 && ~send2 <= 127) && ~p2_new == ~send2 % 256) && 0 < ~send2 / 256 + 1) && 1 <= ~mode2) && ~r1 <= 1) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 401]: Loop Invariant Derived loop invariant: ((1 <= ~mode3 && ~mode3 / 256 <= 0) && (((exists ~send2 : int :: ((~p2_old == ~send2 % 256 && ~send2 % 256 <= 127) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) || ((((((((exists ~send2 : int :: ((~send2 % 256 <= 127 && ~send2 <= 127) && ~p2_new == ~send2 % 256) && 0 < ~send2 / 256 + 1) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~r1 <= 1) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 17.7s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 4.2s AutomataDifference, 0.0s DeadEndRemovalTime, 4.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 408 SDtfs, 207 SDslu, 328 SDs, 0 SdLazy, 132 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 205 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2693occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 1626 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 1180 HoareAnnotationTreeSize, 17 FomulaSimplifications, 97820 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 1260 FormulaSimplificationTreeSizeReductionInter, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 524 NumberOfCodeBlocks, 492 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 608 ConstructedInterpolants, 18 QuantifiedInterpolants, 213012 SizeOfPredicates, 13 NumberOfNonLiveVariables, 700 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 450/576 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...