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/20170319-ConjunctivePathPrograms/interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:25:23,106 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:25:23,109 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:25:23,124 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:25:23,124 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:25:23,125 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:25:23,126 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:25:23,128 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:25:23,130 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:25:23,131 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:25:23,132 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:25:23,132 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:25:23,133 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:25:23,134 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:25:23,135 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:25:23,137 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:25:23,138 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:25:23,140 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:25:23,142 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:25:23,143 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:25:23,144 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:25:23,146 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:25:23,148 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:25:23,149 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:25:23,149 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:25:23,150 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:25:23,151 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:25:23,152 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:25:23,153 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:25:23,154 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:25:23,154 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:25:23,155 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:25:23,155 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:25:23,155 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:25:23,156 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:25:23,157 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:25:23,158 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:25:23,177 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:25:23,177 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:25:23,179 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:25:23,179 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:25:23,179 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:25:23,179 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:25:23,179 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:25:23,180 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:25:23,180 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:25:23,180 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:25:23,180 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:25:23,180 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:25:23,181 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:25:23,181 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:25:23,181 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:25:23,182 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:25:23,182 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:25:23,183 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:25:23,184 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:25:23,184 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:25:23,185 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:25:23,185 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:25:23,185 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:25:23,185 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:25:23,185 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:25:23,186 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:25:23,186 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:25:23,187 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:25:23,187 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:25:23,187 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:25:23,187 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:25:23,187 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:25:23,188 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:25:23,188 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:25:23,188 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:25:23,188 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:25:23,188 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:25:23,188 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:25:23,189 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:25:23,189 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:25:23,189 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:25:23,248 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:25:23,270 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:25:23,276 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:25:23,278 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:25:23,278 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:25:23,279 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl [2018-12-03 16:25:23,279 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl' [2018-12-03 16:25:23,331 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:25:23,332 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:25:23,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:25:23,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:25:23,333 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:25:23,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:23" (1/1) ... [2018-12-03 16:25:23,360 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:23" (1/1) ... [2018-12-03 16:25:23,368 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:25:23,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:25:23,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:25:23,370 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:25:23,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:23" (1/1) ... [2018-12-03 16:25:23,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:23" (1/1) ... [2018-12-03 16:25:23,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:23" (1/1) ... [2018-12-03 16:25:23,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:23" (1/1) ... [2018-12-03 16:25:23,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:23" (1/1) ... [2018-12-03 16:25:23,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:23" (1/1) ... [2018-12-03 16:25:23,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:23" (1/1) ... [2018-12-03 16:25:23,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:25:23,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:25:23,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:25:23,394 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:25:23,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:23" (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:25:23,466 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 16:25:23,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:25:23,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:25:23,701 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:25:23,702 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 16:25:23,702 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:25:23 BoogieIcfgContainer [2018-12-03 16:25:23,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:25:23,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:25:23,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:25:23,707 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:25:23,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:23" (1/2) ... [2018-12-03 16:25:23,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@777e7fe6 and model type interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:25:23, skipping insertion in model container [2018-12-03 16:25:23,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:25:23" (2/2) ... [2018-12-03 16:25:23,711 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl [2018-12-03 16:25:23,722 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:25:23,729 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:25:23,749 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:25:23,786 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:25:23,786 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:25:23,786 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:25:23,786 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:25:23,787 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:25:23,787 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:25:23,787 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:25:23,787 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:25:23,803 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 16:25:23,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 16:25:23,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:23,815 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 16:25:23,826 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:23,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:23,836 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 16:25:23,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:23,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:23,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:23,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:23,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:24,005 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:25:24,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:25:24,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:25:24,007 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:25:24,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:25:24,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:25:24,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:25:24,025 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 16:25:24,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:24,070 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 16:25:24,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:25:24,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 16:25:24,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:24,083 INFO L225 Difference]: With dead ends: 9 [2018-12-03 16:25:24,083 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 16:25:24,087 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:25:24,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 16:25:24,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 16:25:24,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 16:25:24,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 16:25:24,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 16:25:24,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:24,119 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 16:25:24,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:25:24,119 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 16:25:24,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 16:25:24,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:24,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 16:25:24,121 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:24,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:24,121 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-03 16:25:24,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:24,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:24,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:24,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:24,124 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:24,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:24,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:24,295 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:24,296 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 16:25:24,298 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 16:25:24,387 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:25:24,387 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:25:24,690 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:25:24,691 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 3 different actions 7 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 16:25:24,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:24,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:25:24,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:24,706 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:25:24,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:24,726 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:24,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:24,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:24,774 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:24,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:24,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:24,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 16:25:24,880 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:24,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:25:24,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:25:24,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:25:24,882 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-12-03 16:25:24,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:24,910 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 16:25:24,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:25:24,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-03 16:25:24,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:24,911 INFO L225 Difference]: With dead ends: 8 [2018-12-03 16:25:24,911 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 16:25:24,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:25:24,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 16:25:24,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 16:25:24,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 16:25:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 16:25:24,916 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 16:25:24,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:24,916 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 16:25:24,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:25:24,917 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 16:25:24,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:25:24,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:24,917 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 16:25:24,918 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:24,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:24,918 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-03 16:25:24,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:24,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:24,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:24,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:24,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:25,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:25,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:25,018 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:25,018 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:25,018 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:25:25,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:25,018 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:25:25,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:25,029 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:25,045 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:25:25,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:25,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:25,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:25,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:25,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:25,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:25,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 16:25:25,254 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:25,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:25:25,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:25:25,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:25:25,256 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-12-03 16:25:25,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:25,282 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 16:25:25,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:25:25,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 16:25:25,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:25,284 INFO L225 Difference]: With dead ends: 9 [2018-12-03 16:25:25,285 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 16:25:25,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:25:25,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 16:25:25,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 16:25:25,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 16:25:25,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 16:25:25,290 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 16:25:25,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:25,290 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 16:25:25,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:25:25,291 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 16:25:25,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:25:25,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:25,291 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 16:25:25,292 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:25,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:25,292 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-12-03 16:25:25,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:25,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:25,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:25,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:25,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:25,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:25,482 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:25,482 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:25,483 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:25:25,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:25,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:25,504 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:25,504 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:25,545 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:25,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:25,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:25,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:25,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:25,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:25,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:25,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 16:25:25,746 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:25,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:25:25,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:25:25,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:25:25,748 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-12-03 16:25:25,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:25,770 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 16:25:25,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:25:25,772 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 16:25:25,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:25,773 INFO L225 Difference]: With dead ends: 10 [2018-12-03 16:25:25,773 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 16:25:25,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:25:25,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 16:25:25,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 16:25:25,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 16:25:25,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 16:25:25,778 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 16:25:25,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:25,778 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 16:25:25,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:25:25,778 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 16:25:25,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:25:25,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:25,779 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 16:25:25,779 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:25,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:25,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-12-03 16:25:25,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:25,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:25,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:25,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:25,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:25,971 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:25,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:25,971 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:25,972 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:25,972 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:25:25,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:25,973 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:25,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:25,983 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:26,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:26,016 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:26,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:26,126 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:26,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:26,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:25:26,147 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:26,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:25:26,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:25:26,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:25:26,149 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-12-03 16:25:26,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:26,193 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 16:25:26,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:25:26,193 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 16:25:26,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:26,194 INFO L225 Difference]: With dead ends: 11 [2018-12-03 16:25:26,194 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 16:25:26,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:25:26,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 16:25:26,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 16:25:26,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 16:25:26,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 16:25:26,198 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 16:25:26,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:26,198 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 16:25:26,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:25:26,198 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 16:25:26,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:25:26,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:26,199 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 16:25:26,199 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:26,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:26,200 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2018-12-03 16:25:26,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:26,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:26,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:26,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:26,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:26,383 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:26,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:26,384 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:26,384 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:26,384 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:25:26,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:26,384 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:26,400 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:26,401 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:26,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:25:26,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:26,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:26,486 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:26,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:26,784 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:26,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:26,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:25:26,804 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:26,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:25:26,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:25:26,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:25:26,805 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-12-03 16:25:26,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:26,857 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 16:25:26,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:25:26,858 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:25:26,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:26,859 INFO L225 Difference]: With dead ends: 12 [2018-12-03 16:25:26,859 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 16:25:26,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:25:26,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 16:25:26,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 16:25:26,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 16:25:26,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 16:25:26,863 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 16:25:26,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:26,863 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 16:25:26,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:25:26,863 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 16:25:26,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:25:26,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:26,864 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 16:25:26,864 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:26,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:26,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2018-12-03 16:25:26,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:26,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:26,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:26,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:26,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:26,964 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:26,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:26,964 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:26,965 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:26,965 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:25:26,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:26,965 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:26,975 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:26,976 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:26,987 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:26,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:26,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:26,995 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:26,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:27,155 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:27,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:27,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:25:27,175 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:27,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:25:27,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:25:27,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:25:27,176 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-12-03 16:25:27,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:27,213 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 16:25:27,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:25:27,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:25:27,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:27,215 INFO L225 Difference]: With dead ends: 13 [2018-12-03 16:25:27,215 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 16:25:27,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:25:27,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 16:25:27,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 16:25:27,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 16:25:27,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 16:25:27,218 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 16:25:27,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:27,219 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 16:25:27,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:25:27,219 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 16:25:27,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:25:27,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:27,220 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 16:25:27,220 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:27,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:27,220 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2018-12-03 16:25:27,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:27,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:27,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:27,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:27,222 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:27,464 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:27,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:27,464 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:27,465 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:27,465 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:25:27,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:27,465 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:27,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:27,478 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:27,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:27,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:27,824 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:27,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:27,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:25:27,844 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:27,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:25:27,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:25:27,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:25:27,846 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-12-03 16:25:27,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:27,883 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 16:25:27,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:25:27,884 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:25:27,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:27,885 INFO L225 Difference]: With dead ends: 14 [2018-12-03 16:25:27,885 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 16:25:27,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:25:27,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 16:25:27,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 16:25:27,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:25:27,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 16:25:27,889 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 16:25:27,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:27,890 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 16:25:27,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:25:27,890 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 16:25:27,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:25:27,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:27,890 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 16:25:27,891 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:27,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:27,891 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2018-12-03 16:25:27,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:27,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:27,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:27,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:27,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:28,068 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:28,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:28,069 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:28,070 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:28,070 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:25:28,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:28,070 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:28,079 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:28,079 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:28,104 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:25:28,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:28,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:28,113 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:28,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:28,304 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:28,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:28,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 17 [2018-12-03 16:25:28,323 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:28,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:25:28,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:25:28,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:25:28,325 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-12-03 16:25:28,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:28,351 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 16:25:28,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:25:28,351 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:25:28,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:28,352 INFO L225 Difference]: With dead ends: 15 [2018-12-03 16:25:28,352 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 16:25:28,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:25:28,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 16:25:28,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 16:25:28,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:25:28,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 16:25:28,355 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 16:25:28,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:28,355 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 16:25:28,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:25:28,355 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 16:25:28,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:25:28,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:28,356 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 16:25:28,356 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:28,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:28,357 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2018-12-03 16:25:28,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:28,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:28,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:28,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:28,358 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:28,518 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:28,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:28,519 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:28,519 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:28,519 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:25:28,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:28,520 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:28,534 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:28,535 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:28,573 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:28,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:28,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:28,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:28,769 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:28,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:28,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2018-12-03 16:25:28,789 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:28,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:25:28,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:25:28,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:25:28,790 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-12-03 16:25:28,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:28,812 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 16:25:28,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:25:28,813 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:25:28,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:28,814 INFO L225 Difference]: With dead ends: 16 [2018-12-03 16:25:28,814 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 16:25:28,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:25:28,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 16:25:28,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 16:25:28,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:25:28,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 16:25:28,818 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-03 16:25:28,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:28,818 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 16:25:28,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:25:28,818 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 16:25:28,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 16:25:28,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:28,819 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-03 16:25:28,819 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:28,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:28,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2018-12-03 16:25:28,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:28,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:28,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:28,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:28,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:29,036 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:29,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:29,036 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:29,036 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:29,036 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:25:29,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:29,037 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:29,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:29,046 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:29,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:29,079 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:29,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:29,452 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:29,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:29,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 17 [2018-12-03 16:25:29,472 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:29,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:25:29,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:25:29,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:25:29,473 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-12-03 16:25:29,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:29,504 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 16:25:29,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:25:29,504 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-12-03 16:25:29,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:29,505 INFO L225 Difference]: With dead ends: 17 [2018-12-03 16:25:29,505 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 16:25:29,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:25:29,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 16:25:29,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 16:25:29,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:25:29,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 16:25:29,509 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-03 16:25:29,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:29,510 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 16:25:29,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:25:29,510 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 16:25:29,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:25:29,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:29,510 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 16:25:29,511 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:29,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:29,511 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2018-12-03 16:25:29,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:29,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:29,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:29,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:29,512 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:29,767 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:29,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:29,768 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:29,769 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:29,769 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:25:29,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:29,770 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:29,786 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:29,786 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:29,827 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 16:25:29,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:29,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:29,834 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:29,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:30,248 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:30,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:30,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 17 [2018-12-03 16:25:30,271 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:30,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:25:30,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:25:30,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:25:30,272 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-12-03 16:25:30,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:30,297 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 16:25:30,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:25:30,297 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-12-03 16:25:30,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:30,298 INFO L225 Difference]: With dead ends: 18 [2018-12-03 16:25:30,298 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 16:25:30,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:25:30,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 16:25:30,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 16:25:30,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:25:30,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 16:25:30,303 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 16:25:30,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:30,303 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 16:25:30,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:25:30,304 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 16:25:30,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:25:30,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:30,304 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-03 16:25:30,304 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:30,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:30,305 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2018-12-03 16:25:30,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:30,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:30,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:30,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:30,306 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:30,473 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:30,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:30,473 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:30,473 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:30,473 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:25:30,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:30,473 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:30,482 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:30,482 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:30,494 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:30,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:30,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:30,503 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:30,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:30,716 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:30,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:30,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 17 [2018-12-03 16:25:30,745 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:30,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:25:30,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:25:30,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:25:30,747 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-12-03 16:25:30,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:30,800 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 16:25:30,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:25:30,800 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-03 16:25:30,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:30,801 INFO L225 Difference]: With dead ends: 19 [2018-12-03 16:25:30,801 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 16:25:30,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 10 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:25:30,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 16:25:30,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 16:25:30,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:25:30,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 16:25:30,806 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-03 16:25:30,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:30,807 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 16:25:30,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:25:30,807 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 16:25:30,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:25:30,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:30,807 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 16:25:30,808 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:30,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:30,808 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2018-12-03 16:25:30,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:30,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:30,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:30,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:30,809 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:31,046 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:31,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:31,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:31,047 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:31,048 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:25:31,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:31,048 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:31,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:31,059 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:31,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:31,079 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:31,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:31,221 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:31,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:31,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 17 [2018-12-03 16:25:31,240 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:31,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:25:31,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:25:31,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:25:31,241 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-12-03 16:25:31,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:31,471 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 16:25:31,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:25:31,472 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-12-03 16:25:31,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:31,472 INFO L225 Difference]: With dead ends: 20 [2018-12-03 16:25:31,472 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 16:25:31,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 12 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:25:31,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 16:25:31,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 16:25:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:25:31,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 16:25:31,478 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-03 16:25:31,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:31,479 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 16:25:31,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:25:31,479 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 16:25:31,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:25:31,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:31,479 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-03 16:25:31,480 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:31,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:31,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2018-12-03 16:25:31,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:31,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:31,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:31,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:31,481 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:31,716 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:31,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:31,717 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:31,717 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:31,717 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:25:31,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:31,718 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:31,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:31,732 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:31,746 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 16:25:31,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:31,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:31,756 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:31,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:31,939 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:31,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:31,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 17 [2018-12-03 16:25:31,958 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:31,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:25:31,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:25:31,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:25:31,959 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-12-03 16:25:31,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:31,989 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 16:25:31,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:25:31,993 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-12-03 16:25:31,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:31,993 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:25:31,994 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:25:31,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 14 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:25:31,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:25:31,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 16:25:31,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:25:31,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 16:25:31,997 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-03 16:25:31,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:31,997 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 16:25:31,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:25:31,998 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 16:25:31,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:25:31,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:31,998 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 16:25:31,999 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:31,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:31,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2018-12-03 16:25:31,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:32,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:32,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:32,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:32,001 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:32,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:32,315 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:32,315 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:32,315 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:25:32,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:32,315 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:32,325 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:32,325 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:32,338 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:32,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:32,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:32,346 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:32,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:32,731 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:32,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:32,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 17 [2018-12-03 16:25:32,750 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:32,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:25:32,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:25:32,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:25:32,751 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-12-03 16:25:32,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:32,811 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 16:25:32,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:25:32,812 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 16:25:32,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:32,813 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:25:32,813 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:25:32,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 16 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:25:32,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:25:32,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 16:25:32,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:25:32,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 16:25:32,817 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-03 16:25:32,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:32,817 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 16:25:32,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:25:32,817 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 16:25:32,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 16:25:32,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:32,818 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-03 16:25:32,818 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:32,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:32,818 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2018-12-03 16:25:32,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:32,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:32,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:32,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:32,820 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 16:25:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 16:25:32,854 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 16:25:32,878 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:25:32 BoogieIcfgContainer [2018-12-03 16:25:32,878 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:25:32,879 INFO L168 Benchmark]: Toolchain (without parser) took 9547.49 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 685.8 MB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -340.0 MB). Peak memory consumption was 345.8 MB. Max. memory is 7.1 GB. [2018-12-03 16:25:32,881 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:25:32,882 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:25:32,882 INFO L168 Benchmark]: Boogie Preprocessor took 23.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:25:32,883 INFO L168 Benchmark]: RCFGBuilder took 309.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 16:25:32,883 INFO L168 Benchmark]: TraceAbstraction took 9174.78 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 685.8 MB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -361.2 MB). Peak memory consumption was 324.6 MB. Max. memory is 7.1 GB. [2018-12-03 16:25:32,887 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.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 309.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9174.78 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 685.8 MB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -361.2 MB). Peak memory consumption was 324.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 61]: assertion can be violated assertion can be violated We found a FailurePath: [L18] havoc main_#res; [L19] havoc main_#t~nondet0, main_~yy~5, main_~z~5, main_#t~nondet1, main_~xx~5, main_~x~5, main_~y~5, main_~zz~5, main_~i~5; [L20] main_~x~5 := main_#t~nondet0; [L21] havoc main_#t~nondet0; [L22] main_~y~5 := main_#t~nondet1; [L23] havoc main_#t~nondet1; [L24] havoc main_~xx~5; [L25] havoc main_~yy~5; [L26] havoc main_~zz~5; [L27] main_~z~5 := 0; [L28] main_~i~5 := 0; VAL [main_~i~5=0, main_~x~5=-65537, main_~y~5=-65537, main_~z~5=0] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=1, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=2, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=3, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=4, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=5, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=6, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=7, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=8, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=9, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=10, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=11, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=12, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=13, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=14, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=15, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=16, main_~x~5=-65537, main_~y~5=-65537] [L35] assume main_~i~5 < 4294967296 && !(main_~i~5 < 16); [L36] assume main_~x~5 < -65536; [L37] main_~xx~5 := main_~x~5 % 65536; [L38] assume main_~y~5 < -65536; [L39] main_~yy~5 := main_~y~5 % 65536; [L40] havoc main_~xx~5; [L41] havoc main_~xx~5; [L42] havoc main_~xx~5; [L43] havoc main_~xx~5; [L44] havoc main_~yy~5; [L45] havoc main_~yy~5; [L46] havoc main_~yy~5; [L47] havoc main_~yy~5; [L48] havoc main_~zz~5; [L49] assume (((main_~zz~5 < 4294967296 && 0 <= main_~zz~5) && -4294967296 <= main_~z~5) && main_~z~5 < 0) && !(main_~z~5 + 4294967296 == main_~zz~5); [L50] __VERIFIER_assert_#in~cond := 0; [L51] havoc __VERIFIER_assert_~cond; [L52] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L53] assume __VERIFIER_assert_~cond == 0; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~5=16, main_~x~5=-65537, main_~y~5=-65537, main_~zz~5=0, main_~z~5=-1] [L61] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~5=16, main_~x~5=-65537, main_~y~5=-65537, main_~zz~5=0, main_~z~5=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. UNSAFE Result, 9.1s OverallTime, 17 OverallIterations, 16 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 SDtfs, 0 SDslu, 111 SDs, 0 SdLazy, 262 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 452 GetRequests, 181 SyntacticMatches, 72 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 352 NumberOfCodeBlocks, 352 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 452 ConstructedInterpolants, 0 QuantifiedInterpolants, 15128 SizeOfPredicates, 15 NumberOfNonLiveVariables, 870 ConjunctsInSsa, 150 ConjunctsInUnsatCore, 46 InterpolantComputations, 1 PerfectInterpolantSequences, 0/2040 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...