java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 17:06:28,244 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 17:06:28,247 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 17:06:28,262 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 17:06:28,263 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 17:06:28,265 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 17:06:28,267 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 17:06:28,270 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 17:06:28,272 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 17:06:28,274 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 17:06:28,275 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 17:06:28,275 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 17:06:28,277 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 17:06:28,278 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 17:06:28,279 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 17:06:28,280 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 17:06:28,283 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 17:06:28,293 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 17:06:28,297 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 17:06:28,299 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 17:06:28,300 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 17:06:28,302 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 17:06:28,304 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 17:06:28,305 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 17:06:28,305 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 17:06:28,306 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 17:06:28,309 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 17:06:28,310 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 17:06:28,311 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 17:06:28,311 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 17:06:28,312 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 17:06:28,312 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 17:06:28,312 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 17:06:28,313 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 17:06:28,315 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 17:06:28,316 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 17:06:28,316 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-31 17:06:28,328 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 17:06:28,329 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 17:06:28,329 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 17:06:28,329 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 17:06:28,330 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 17:06:28,330 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 17:06:28,330 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 17:06:28,330 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 17:06:28,330 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 17:06:28,331 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 17:06:28,331 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 17:06:28,331 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 17:06:28,331 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 17:06:28,331 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 17:06:28,332 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 17:06:28,332 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 17:06:28,332 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 17:06:28,332 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 17:06:28,333 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 17:06:28,333 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 17:06:28,333 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 17:06:28,333 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 17:06:28,333 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 17:06:28,334 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 17:06:28,334 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 17:06:28,334 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 17:06:28,334 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 17:06:28,334 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 17:06:28,335 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 17:06:28,335 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 17:06:28,335 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 17:06:28,335 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:06:28,335 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 17:06:28,335 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 17:06:28,336 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 17:06:28,336 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 17:06:28,336 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 17:06:28,336 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 17:06:28,336 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 17:06:28,336 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 17:06:28,364 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 17:06:28,376 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 17:06:28,380 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 17:06:28,381 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 17:06:28,381 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 17:06:28,382 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl [2019-01-31 17:06:28,382 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl' [2019-01-31 17:06:28,417 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 17:06:28,418 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 17:06:28,419 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 17:06:28,419 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 17:06:28,419 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 17:06:28,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:28" (1/1) ... [2019-01-31 17:06:28,447 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:28" (1/1) ... [2019-01-31 17:06:28,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 17:06:28,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 17:06:28,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 17:06:28,472 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 17:06:28,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:28" (1/1) ... [2019-01-31 17:06:28,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:28" (1/1) ... [2019-01-31 17:06:28,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:28" (1/1) ... [2019-01-31 17:06:28,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:28" (1/1) ... [2019-01-31 17:06:28,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:28" (1/1) ... [2019-01-31 17:06:28,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:28" (1/1) ... [2019-01-31 17:06:28,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:28" (1/1) ... [2019-01-31 17:06:28,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 17:06:28,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 17:06:28,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 17:06:28,496 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 17:06:28,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:28" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:06:28,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 17:06:28,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 17:06:28,825 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 17:06:28,825 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-31 17:06:28,827 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:06:28 BoogieIcfgContainer [2019-01-31 17:06:28,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 17:06:28,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 17:06:28,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 17:06:28,832 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 17:06:28,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:28" (1/2) ... [2019-01-31 17:06:28,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d34652e and model type speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:06:28, skipping insertion in model container [2019-01-31 17:06:28,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:06:28" (2/2) ... [2019-01-31 17:06:28,835 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-unlimited.bpl [2019-01-31 17:06:28,845 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 17:06:28,853 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-31 17:06:28,870 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-31 17:06:28,906 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 17:06:28,907 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 17:06:28,907 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 17:06:28,907 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 17:06:28,907 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 17:06:28,907 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 17:06:28,908 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 17:06:28,908 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 17:06:28,927 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-31 17:06:28,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-31 17:06:28,938 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:28,939 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-31 17:06:28,944 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:28,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:28,952 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-01-31 17:06:28,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:29,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:29,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:29,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:29,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:29,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:29,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:06:29,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:06:29,182 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:06:29,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:06:29,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:06:29,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:06:29,200 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-01-31 17:06:29,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:29,560 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-01-31 17:06:29,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:06:29,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 17:06:29,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:29,584 INFO L225 Difference]: With dead ends: 21 [2019-01-31 17:06:29,584 INFO L226 Difference]: Without dead ends: 16 [2019-01-31 17:06:29,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:06:29,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-31 17:06:29,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-01-31 17:06:29,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-31 17:06:29,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-01-31 17:06:29,630 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-01-31 17:06:29,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:29,631 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-01-31 17:06:29,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:06:29,632 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-01-31 17:06:29,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:06:29,632 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:29,633 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:06:29,633 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:29,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:29,634 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-01-31 17:06:29,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:29,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:29,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:29,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:29,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:29,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:29,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:29,754 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:29,755 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:06:29,757 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-01-31 17:06:29,794 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:29,794 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:29,858 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:29,859 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 2. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:06:29,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:29,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:29,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:29,879 INFO L193 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 [2019-01-31 17:06:29,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:29,898 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:29,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:30,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:30,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:06:30,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:06:30,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:06:30,142 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:30,324 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:30,444 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:30,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:30,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:06:30,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:06:30,736 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-01-31 17:06:30,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:06:30,766 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:30,779 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:30,788 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:30,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:30,830 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-31 17:06:30,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:06:30,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:30,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:30,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-31 17:06:30,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:30,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:31,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:31,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:31,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:06:31,089 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:31,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:06:31,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:06:31,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:06:31,090 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2019-01-31 17:06:31,280 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-31 17:06:31,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:31,745 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2019-01-31 17:06:31,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:06:31,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:06:31,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:31,748 INFO L225 Difference]: With dead ends: 31 [2019-01-31 17:06:31,748 INFO L226 Difference]: Without dead ends: 28 [2019-01-31 17:06:31,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:06:31,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-31 17:06:31,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 13. [2019-01-31 17:06:31,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-31 17:06:31,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2019-01-31 17:06:31,756 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2019-01-31 17:06:31,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:31,757 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2019-01-31 17:06:31,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:06:31,757 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2019-01-31 17:06:31,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:06:31,758 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:31,758 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:06:31,758 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:31,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:31,758 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-01-31 17:06:31,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:31,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:31,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:31,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:31,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:31,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:31,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:06:31,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:06:31,794 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:06:31,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:06:31,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:06:31,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:06:31,796 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2019-01-31 17:06:31,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:31,844 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2019-01-31 17:06:31,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:06:31,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 17:06:31,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:31,845 INFO L225 Difference]: With dead ends: 15 [2019-01-31 17:06:31,846 INFO L226 Difference]: Without dead ends: 14 [2019-01-31 17:06:31,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:06:31,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-31 17:06:31,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-01-31 17:06:31,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-31 17:06:31,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2019-01-31 17:06:31,850 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2019-01-31 17:06:31,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:31,851 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2019-01-31 17:06:31,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:06:31,851 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2019-01-31 17:06:31,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:06:31,851 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:31,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:06:31,852 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:31,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:31,852 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-01-31 17:06:31,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:31,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:31,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:31,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:31,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:31,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:31,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:31,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:31,953 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:06:31,953 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-01-31 17:06:31,954 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:31,954 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:31,961 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:31,961 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 2. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:06:31,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:31,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:31,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:31,962 INFO L193 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 [2019-01-31 17:06:31,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:31,975 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:31,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:32,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:32,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:06:32,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:06:32,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-31 17:06:32,045 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:32,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:32,084 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:32,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:32,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-31 17:06:32,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-31 17:06:32,153 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:32,159 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:32,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:32,178 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:35, output treesize:33 [2019-01-31 17:06:32,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-31 17:06:32,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:32,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:32,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-31 17:06:32,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:32,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:32,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:32,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:06:32,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-31 17:06:32,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:06:32,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:06:32,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:06:32,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:06:32,288 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 4 states. [2019-01-31 17:06:32,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:32,424 INFO L93 Difference]: Finished difference Result 18 states and 41 transitions. [2019-01-31 17:06:32,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:06:32,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 17:06:32,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:32,426 INFO L225 Difference]: With dead ends: 18 [2019-01-31 17:06:32,426 INFO L226 Difference]: Without dead ends: 17 [2019-01-31 17:06:32,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:06:32,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-31 17:06:32,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-31 17:06:32,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-31 17:06:32,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2019-01-31 17:06:32,432 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3 [2019-01-31 17:06:32,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:32,433 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2019-01-31 17:06:32,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:06:32,433 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2019-01-31 17:06:32,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:06:32,434 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:32,434 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:06:32,434 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:32,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:32,434 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-01-31 17:06:32,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:32,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:32,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:32,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:32,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:32,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:32,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:32,495 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:06:32,495 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-01-31 17:06:32,496 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:32,497 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:32,503 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:32,503 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 2. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:06:32,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:32,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:32,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:32,503 INFO L193 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 [2019-01-31 17:06:32,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:32,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:32,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:32,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-31 17:06:32,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-31 17:06:32,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:32,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:32,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:32,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:06:32,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:06:32,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-31 17:06:32,657 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:32,688 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:32,722 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:32,734 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:32,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:32,751 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2019-01-31 17:06:32,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-31 17:06:32,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:32,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:32,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-31 17:06:32,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:32,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:32,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:32,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:32,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:06:32,869 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:32,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:06:32,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:06:32,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:06:32,870 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 6 states. [2019-01-31 17:06:33,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:33,030 INFO L93 Difference]: Finished difference Result 32 states and 62 transitions. [2019-01-31 17:06:33,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:06:33,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:06:33,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:33,031 INFO L225 Difference]: With dead ends: 32 [2019-01-31 17:06:33,031 INFO L226 Difference]: Without dead ends: 31 [2019-01-31 17:06:33,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:06:33,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-31 17:06:33,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2019-01-31 17:06:33,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-31 17:06:33,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2019-01-31 17:06:33,038 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 50 transitions. Word has length 3 [2019-01-31 17:06:33,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:33,039 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 50 transitions. [2019-01-31 17:06:33,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:06:33,039 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 50 transitions. [2019-01-31 17:06:33,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:33,040 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:33,040 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:33,040 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:33,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:33,041 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-01-31 17:06:33,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:33,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:33,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:33,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:33,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:33,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:33,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:33,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:33,130 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:33,130 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-01-31 17:06:33,135 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:33,135 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:33,143 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:33,144 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:06:33,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:33,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:33,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:33,145 INFO L193 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 [2019-01-31 17:06:33,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:33,155 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:33,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:33,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:33,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:06:33,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:33,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:33,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:06:33,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:33,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:33,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:33,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:33,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:06:33,317 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:33,332 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:33,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:33,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:33,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:06:33,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:06:33,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:06:33,408 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:33,466 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:33,474 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:33,508 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:33,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:33,525 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-31 17:06:33,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:33,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:06:33,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:33,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:33,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-31 17:06:33,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:33,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:33,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:33,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:06:33,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-31 17:06:33,710 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:06:33,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:06:33,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:06:33,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:06:33,711 INFO L87 Difference]: Start difference. First operand 18 states and 50 transitions. Second operand 4 states. [2019-01-31 17:06:33,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:33,750 INFO L93 Difference]: Finished difference Result 22 states and 58 transitions. [2019-01-31 17:06:33,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:06:33,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 17:06:33,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:33,754 INFO L225 Difference]: With dead ends: 22 [2019-01-31 17:06:33,754 INFO L226 Difference]: Without dead ends: 21 [2019-01-31 17:06:33,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:06:33,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-31 17:06:33,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-31 17:06:33,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-31 17:06:33,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2019-01-31 17:06:33,760 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2019-01-31 17:06:33,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:33,760 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2019-01-31 17:06:33,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:06:33,760 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2019-01-31 17:06:33,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:33,761 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:33,761 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:33,761 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:33,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:33,762 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-01-31 17:06:33,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:33,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:33,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:33,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:33,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:33,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:33,825 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:33,825 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:33,825 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-01-31 17:06:33,827 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:33,827 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:33,832 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:33,832 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:06:33,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:33,833 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:33,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:33,833 INFO L193 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 [2019-01-31 17:06:33,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:33,842 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:33,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:33,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:33,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:06:33,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:33,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:33,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:06:33,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:33,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:33,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:33,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:06:33,898 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:33,924 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:33,934 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:33,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:33,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:33,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:06:34,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:06:34,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:06:34,128 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:34,141 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:34,150 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:34,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:34,187 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:06:34,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:06:34,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:34,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:34,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:06:34,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,561 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:34,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-31 17:06:34,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:34,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:34,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2019-01-31 17:06:34,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:34,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:34,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:34,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:34,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:34,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:34,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:34,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:34,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:34,739 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 8 states. [2019-01-31 17:06:35,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:35,091 INFO L93 Difference]: Finished difference Result 37 states and 74 transitions. [2019-01-31 17:06:35,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:06:35,092 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:06:35,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:35,093 INFO L225 Difference]: With dead ends: 37 [2019-01-31 17:06:35,093 INFO L226 Difference]: Without dead ends: 36 [2019-01-31 17:06:35,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:06:35,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-31 17:06:35,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. [2019-01-31 17:06:35,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-31 17:06:35,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2019-01-31 17:06:35,100 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 4 [2019-01-31 17:06:35,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:35,101 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2019-01-31 17:06:35,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:35,101 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2019-01-31 17:06:35,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:35,101 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:35,101 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:35,102 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:35,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:35,102 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2019-01-31 17:06:35,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:35,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:35,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:35,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:35,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:35,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:35,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:35,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:35,295 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:35,296 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-01-31 17:06:35,298 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:35,298 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:35,303 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:35,303 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:06:35,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:35,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:35,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:35,304 INFO L193 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 [2019-01-31 17:06:35,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:35,316 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:35,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:35,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:06:35,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:06:35,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:06:35,415 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:35,464 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:35,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:35,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:35,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:06:35,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:06:35,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:06:35,534 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:35,568 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:35,577 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:35,586 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:35,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:35,618 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:06:35,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:06:35,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:35,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:35,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:06:35,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-31 17:06:35,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:35,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:35,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-31 17:06:35,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:35,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:35,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:35,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:35,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:35,866 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:35,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:35,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:35,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:35,867 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 8 states. [2019-01-31 17:06:36,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:36,193 INFO L93 Difference]: Finished difference Result 46 states and 87 transitions. [2019-01-31 17:06:36,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:06:36,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:06:36,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:36,196 INFO L225 Difference]: With dead ends: 46 [2019-01-31 17:06:36,196 INFO L226 Difference]: Without dead ends: 40 [2019-01-31 17:06:36,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:06:36,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-31 17:06:36,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2019-01-31 17:06:36,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-31 17:06:36,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2019-01-31 17:06:36,212 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 58 transitions. Word has length 4 [2019-01-31 17:06:36,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:36,212 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 58 transitions. [2019-01-31 17:06:36,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:36,213 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 58 transitions. [2019-01-31 17:06:36,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:36,213 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:36,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:36,214 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:36,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:36,214 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 1 times [2019-01-31 17:06:36,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:36,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:36,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:36,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:36,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:36,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:36,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:36,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:36,352 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:36,353 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-01-31 17:06:36,354 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:36,354 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:36,358 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:36,358 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:06:36,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:36,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:36,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:36,359 INFO L193 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 [2019-01-31 17:06:36,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:36,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:36,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:36,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:36,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:06:36,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:06:36,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:06:36,511 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:36,533 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:36,543 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:36,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:36,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:06:36,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:06:36,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:06:36,673 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:36,681 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:36,689 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:36,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:36,708 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-31 17:06:36,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:06:36,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:36,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:36,757 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:06:36,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-31 17:06:36,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:36,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:36,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-31 17:06:36,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:36,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:36,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:36,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:06:36,852 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:36,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:36,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:36,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:06:36,852 INFO L87 Difference]: Start difference. First operand 22 states and 58 transitions. Second operand 8 states. [2019-01-31 17:06:37,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:37,035 INFO L93 Difference]: Finished difference Result 52 states and 124 transitions. [2019-01-31 17:06:37,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:06:37,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:06:37,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:37,037 INFO L225 Difference]: With dead ends: 52 [2019-01-31 17:06:37,037 INFO L226 Difference]: Without dead ends: 49 [2019-01-31 17:06:37,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:06:37,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-31 17:06:37,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 26. [2019-01-31 17:06:37,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-31 17:06:37,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 78 transitions. [2019-01-31 17:06:37,047 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 78 transitions. Word has length 4 [2019-01-31 17:06:37,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:37,047 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 78 transitions. [2019-01-31 17:06:37,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:37,047 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 78 transitions. [2019-01-31 17:06:37,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:37,048 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:37,048 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:37,048 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:37,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:37,048 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2019-01-31 17:06:37,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:37,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:37,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:37,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:37,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:37,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:37,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:37,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:37,086 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:37,086 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2019-01-31 17:06:37,088 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:37,088 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:37,091 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:37,092 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:06:37,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:37,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:37,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:37,092 INFO L193 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 [2019-01-31 17:06:37,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:37,112 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:37,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:37,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-31 17:06:37,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-31 17:06:37,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:37,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:37,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:37,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:06:37,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:06:37,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-31 17:06:37,209 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:37,221 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:37,230 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:37,236 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:37,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:37,250 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2019-01-31 17:06:37,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-31 17:06:37,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:37,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:37,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-31 17:06:37,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:37,305 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:37,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:37,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:37,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:06:37,392 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:37,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:06:37,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:06:37,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:06:37,393 INFO L87 Difference]: Start difference. First operand 26 states and 78 transitions. Second operand 6 states. [2019-01-31 17:06:37,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:37,595 INFO L93 Difference]: Finished difference Result 36 states and 91 transitions. [2019-01-31 17:06:37,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:06:37,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 17:06:37,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:37,597 INFO L225 Difference]: With dead ends: 36 [2019-01-31 17:06:37,597 INFO L226 Difference]: Without dead ends: 35 [2019-01-31 17:06:37,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:06:37,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-31 17:06:37,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-01-31 17:06:37,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-31 17:06:37,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 84 transitions. [2019-01-31 17:06:37,606 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 84 transitions. Word has length 4 [2019-01-31 17:06:37,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:37,606 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 84 transitions. [2019-01-31 17:06:37,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:06:37,606 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 84 transitions. [2019-01-31 17:06:37,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:37,607 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:37,607 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:37,607 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:37,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:37,607 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2019-01-31 17:06:37,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:37,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:37,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:37,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:37,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:37,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:37,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:37,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:37,692 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:37,692 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2019-01-31 17:06:37,693 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:37,693 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:37,697 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:37,700 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:06:37,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:37,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:37,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:37,700 INFO L193 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 [2019-01-31 17:06:37,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:37,709 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:37,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:37,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:37,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:06:37,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:06:37,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:06:37,756 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:37,781 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:37,798 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:37,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:37,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:06:37,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:06:37,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:06:37,915 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:37,923 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:37,933 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:37,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:37,951 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:06:37,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:06:37,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:38,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:38,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:06:38,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-31 17:06:38,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:38,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:38,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-31 17:06:38,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:38,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:38,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:38,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:38,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:38,179 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:38,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:38,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:38,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:38,180 INFO L87 Difference]: Start difference. First operand 28 states and 84 transitions. Second operand 8 states. [2019-01-31 17:06:38,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:38,556 INFO L93 Difference]: Finished difference Result 52 states and 123 transitions. [2019-01-31 17:06:38,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:06:38,557 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:06:38,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:38,558 INFO L225 Difference]: With dead ends: 52 [2019-01-31 17:06:38,558 INFO L226 Difference]: Without dead ends: 50 [2019-01-31 17:06:38,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:06:38,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-31 17:06:38,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2019-01-31 17:06:38,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-31 17:06:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 99 transitions. [2019-01-31 17:06:38,569 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 99 transitions. Word has length 4 [2019-01-31 17:06:38,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:38,569 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 99 transitions. [2019-01-31 17:06:38,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:38,569 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 99 transitions. [2019-01-31 17:06:38,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:38,570 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:38,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:38,570 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:38,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:38,571 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2019-01-31 17:06:38,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:38,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:38,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:38,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:38,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:38,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:38,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:38,605 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:38,606 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:38,606 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [21] [2019-01-31 17:06:38,606 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:38,607 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:38,614 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:38,614 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:06:38,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:38,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:38,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:38,614 INFO L193 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 [2019-01-31 17:06:38,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:38,625 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:38,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:38,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:38,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-31 17:06:38,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-01-31 17:06:38,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-31 17:06:38,676 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:38,700 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:38,708 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:38,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:38,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-31 17:06:38,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-31 17:06:38,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-31 17:06:38,806 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:38,812 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:38,821 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:38,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:38,838 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:41, output treesize:41 [2019-01-31 17:06:38,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2019-01-31 17:06:38,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:38,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:38,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-01-31 17:06:38,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:38,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:38,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:38,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:06:38,964 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:38,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:06:38,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:06:38,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:06:38,965 INFO L87 Difference]: Start difference. First operand 31 states and 99 transitions. Second operand 6 states. [2019-01-31 17:06:39,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:39,088 INFO L93 Difference]: Finished difference Result 39 states and 105 transitions. [2019-01-31 17:06:39,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:06:39,089 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 17:06:39,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:39,089 INFO L225 Difference]: With dead ends: 39 [2019-01-31 17:06:39,090 INFO L226 Difference]: Without dead ends: 38 [2019-01-31 17:06:39,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:06:39,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-31 17:06:39,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2019-01-31 17:06:39,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-31 17:06:39,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-01-31 17:06:39,100 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 4 [2019-01-31 17:06:39,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:39,100 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-01-31 17:06:39,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:06:39,101 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-01-31 17:06:39,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:39,101 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:39,101 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-31 17:06:39,102 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:39,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:39,102 INFO L82 PathProgramCache]: Analyzing trace with hash 29121388, now seen corresponding path program 2 times [2019-01-31 17:06:39,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:39,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:39,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:39,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:39,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:39,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:06:39,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:39,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:39,180 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:06:39,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:06:39,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:39,180 INFO L193 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 [2019-01-31 17:06:39,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:06:39,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:06:39,202 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:06:39,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:06:39,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:39,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:06:39,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:06:39,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:06:39,294 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:39,309 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:39,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:39,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:39,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:06:39,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:06:39,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:06:39,349 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:39,362 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:39,371 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:39,379 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:39,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:39,398 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-31 17:06:39,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:06:39,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:39,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:39,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:06:39,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-01-31 17:06:39,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:39,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:39,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:33 [2019-01-31 17:06:39,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:06:39,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:39,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:39,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-31 17:06:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:39,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:39,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:39,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:39,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-31 17:06:39,604 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:39,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:06:39,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:06:39,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:06:39,605 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 9 states. [2019-01-31 17:06:40,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:40,041 INFO L93 Difference]: Finished difference Result 65 states and 148 transitions. [2019-01-31 17:06:40,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:06:40,041 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-31 17:06:40,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:40,042 INFO L225 Difference]: With dead ends: 65 [2019-01-31 17:06:40,042 INFO L226 Difference]: Without dead ends: 60 [2019-01-31 17:06:40,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:06:40,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-31 17:06:40,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 32. [2019-01-31 17:06:40,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-31 17:06:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2019-01-31 17:06:40,053 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2019-01-31 17:06:40,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:40,053 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2019-01-31 17:06:40,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:06:40,053 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2019-01-31 17:06:40,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:40,054 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:40,054 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-31 17:06:40,054 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:40,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:40,055 INFO L82 PathProgramCache]: Analyzing trace with hash 29121636, now seen corresponding path program 2 times [2019-01-31 17:06:40,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:40,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:40,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:06:40,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:40,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:40,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:06:40,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:40,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:40,164 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:06:40,164 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:06:40,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:40,164 INFO L193 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 [2019-01-31 17:06:40,172 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:06:40,172 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:06:40,203 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:06:40,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:06:40,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:40,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:40,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:06:40,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:06:40,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:06:40,254 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:40,271 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:40,281 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:40,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:40,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:06:40,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:06:40,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:06:40,371 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:40,379 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:40,389 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:40,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:40,407 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:06:40,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:06:40,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:40,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:40,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:06:40,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-01-31 17:06:40,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:40,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:40,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-01-31 17:06:40,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-31 17:06:40,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:40,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:40,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-31 17:06:40,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:40,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:40,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:40,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:40,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-31 17:06:40,678 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:40,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:06:40,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:06:40,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:06:40,679 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 9 states. [2019-01-31 17:06:41,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:41,138 INFO L93 Difference]: Finished difference Result 53 states and 146 transitions. [2019-01-31 17:06:41,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:06:41,138 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-31 17:06:41,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:41,139 INFO L225 Difference]: With dead ends: 53 [2019-01-31 17:06:41,139 INFO L226 Difference]: Without dead ends: 51 [2019-01-31 17:06:41,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:06:41,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-31 17:06:41,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2019-01-31 17:06:41,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-31 17:06:41,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2019-01-31 17:06:41,149 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2019-01-31 17:06:41,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:41,149 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2019-01-31 17:06:41,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:06:41,149 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2019-01-31 17:06:41,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:41,150 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:41,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:41,150 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:41,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:41,151 INFO L82 PathProgramCache]: Analyzing trace with hash 29112214, now seen corresponding path program 1 times [2019-01-31 17:06:41,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:41,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:41,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:06:41,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:41,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:41,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:41,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:41,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:41,202 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:06:41,202 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [21] [2019-01-31 17:06:41,203 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:41,203 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:41,208 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:41,208 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:06:41,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:41,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:41,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:41,209 INFO L193 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 [2019-01-31 17:06:41,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:41,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:41,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:41,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:06:41,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:06:41,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:06:41,353 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:41,364 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:41,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:41,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:41,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:06:41,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:06:41,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:06:41,396 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:41,410 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:41,418 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:41,426 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:41,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:41,445 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:06:41,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:06:41,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:41,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:41,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:06:41,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:06:41,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:41,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:41,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-31 17:06:41,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:41,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:41,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:41,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:41,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:41,601 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:41,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:41,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:41,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:41,602 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 8 states. [2019-01-31 17:06:41,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:41,860 INFO L93 Difference]: Finished difference Result 54 states and 147 transitions. [2019-01-31 17:06:41,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:06:41,861 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:06:41,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:41,862 INFO L225 Difference]: With dead ends: 54 [2019-01-31 17:06:41,862 INFO L226 Difference]: Without dead ends: 53 [2019-01-31 17:06:41,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:06:41,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-31 17:06:41,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2019-01-31 17:06:41,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-31 17:06:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2019-01-31 17:06:41,874 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 122 transitions. Word has length 5 [2019-01-31 17:06:41,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:41,874 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 122 transitions. [2019-01-31 17:06:41,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:41,874 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 122 transitions. [2019-01-31 17:06:41,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:41,875 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:41,875 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:41,875 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:41,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:41,876 INFO L82 PathProgramCache]: Analyzing trace with hash 29115622, now seen corresponding path program 1 times [2019-01-31 17:06:41,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:41,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:41,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:41,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:41,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:42,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:42,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:42,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:42,008 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:06:42,008 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2019-01-31 17:06:42,009 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:42,010 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:42,013 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:42,013 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:06:42,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:42,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:42,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:42,014 INFO L193 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 [2019-01-31 17:06:42,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:42,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:42,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:42,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:42,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:06:42,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:06:42,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-31 17:06:42,091 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:42,102 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:42,113 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:42,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:42,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-31 17:06:42,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-31 17:06:42,159 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:42,185 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:42,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:42,197 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2019-01-31 17:06:42,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:06:42,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-31 17:06:42,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2019-01-31 17:06:42,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:100 [2019-01-31 17:06:42,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,447 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:42,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 45 [2019-01-31 17:06:42,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:42,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,496 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:42,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 45 [2019-01-31 17:06:42,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:42,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 44 [2019-01-31 17:06:42,556 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:42,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-01-31 17:06:42,590 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:97, output treesize:63 [2019-01-31 17:06:42,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 44 [2019-01-31 17:06:42,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:42,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,699 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:42,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 44 [2019-01-31 17:06:42,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:42,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 50 [2019-01-31 17:06:42,744 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:42,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-01-31 17:06:42,778 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:101, output treesize:65 [2019-01-31 17:06:42,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:42,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:42,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:42,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2019-01-31 17:06:42,851 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:42,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:06:42,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:06:42,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:42,852 INFO L87 Difference]: Start difference. First operand 35 states and 122 transitions. Second operand 10 states. [2019-01-31 17:06:43,527 WARN L181 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 42 [2019-01-31 17:06:44,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:44,167 INFO L93 Difference]: Finished difference Result 81 states and 236 transitions. [2019-01-31 17:06:44,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-31 17:06:44,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:06:44,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:44,168 INFO L225 Difference]: With dead ends: 81 [2019-01-31 17:06:44,168 INFO L226 Difference]: Without dead ends: 80 [2019-01-31 17:06:44,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:06:44,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-31 17:06:44,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 40. [2019-01-31 17:06:44,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-31 17:06:44,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 148 transitions. [2019-01-31 17:06:44,189 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 148 transitions. Word has length 5 [2019-01-31 17:06:44,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:44,189 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 148 transitions. [2019-01-31 17:06:44,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:06:44,189 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 148 transitions. [2019-01-31 17:06:44,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:44,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:44,190 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:44,190 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:44,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:44,191 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2019-01-31 17:06:44,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:44,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:44,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:44,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:44,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:44,349 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-31 17:06:44,536 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:44,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:44,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:44,536 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:06:44,537 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2019-01-31 17:06:44,537 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:44,538 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:44,541 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:44,541 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:06:44,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:44,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:44,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:44,541 INFO L193 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 [2019-01-31 17:06:44,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:44,554 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:44,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:44,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:44,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:06:44,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:06:44,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:06:44,591 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:44,609 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:44,619 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:44,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:44,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:06:44,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:06:44,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:06:44,722 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:44,731 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:44,740 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:44,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:44,758 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-31 17:06:44,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:06:44,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:44,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:44,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:06:44,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,900 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:44,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-31 17:06:44,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:44,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:44,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:29 [2019-01-31 17:06:44,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 69 [2019-01-31 17:06:44,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:45,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:45,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-31 17:06:45,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:45,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:45,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:45,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:45,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:06:45,173 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:45,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:06:45,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:06:45,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:06:45,174 INFO L87 Difference]: Start difference. First operand 40 states and 148 transitions. Second operand 10 states. [2019-01-31 17:06:45,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:45,599 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-01-31 17:06:45,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:06:45,600 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:06:45,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:45,601 INFO L225 Difference]: With dead ends: 66 [2019-01-31 17:06:45,602 INFO L226 Difference]: Without dead ends: 64 [2019-01-31 17:06:45,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:06:45,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-31 17:06:45,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 41. [2019-01-31 17:06:45,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-31 17:06:45,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-01-31 17:06:45,617 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-01-31 17:06:45,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:45,617 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-01-31 17:06:45,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:06:45,617 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-01-31 17:06:45,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:45,618 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:45,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:45,618 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:45,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:45,619 INFO L82 PathProgramCache]: Analyzing trace with hash 29119902, now seen corresponding path program 1 times [2019-01-31 17:06:45,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:45,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:45,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:45,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:45,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:45,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:45,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:45,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:45,693 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:06:45,693 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [21] [2019-01-31 17:06:45,694 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:45,694 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:45,698 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:45,698 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:06:45,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:45,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:45,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:45,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:45,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:45,710 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:45,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:45,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-31 17:06:45,854 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:06:45,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-31 17:06:46,303 WARN L181 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2019-01-31 17:06:46,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,419 INFO L303 Elim1Store]: Index analysis took 114 ms [2019-01-31 17:06:46,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-31 17:06:46,420 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:46,569 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:46,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:46,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:46,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-31 17:06:46,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-01-31 17:06:46,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-31 17:06:46,838 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:46,857 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:46,865 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:46,872 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:46,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:46,888 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-01-31 17:06:46,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-31 17:06:46,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:46,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:46,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-31 17:06:46,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:06:47,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:47,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:47,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-01-31 17:06:47,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:47,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:47,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:47,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:47,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:06:47,096 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:47,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:47,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:47,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:06:47,097 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 8 states. [2019-01-31 17:06:47,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:47,360 INFO L93 Difference]: Finished difference Result 62 states and 176 transitions. [2019-01-31 17:06:47,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:06:47,361 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:06:47,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:47,362 INFO L225 Difference]: With dead ends: 62 [2019-01-31 17:06:47,362 INFO L226 Difference]: Without dead ends: 61 [2019-01-31 17:06:47,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:47,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-31 17:06:47,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2019-01-31 17:06:47,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-31 17:06:47,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 137 transitions. [2019-01-31 17:06:47,377 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 137 transitions. Word has length 5 [2019-01-31 17:06:47,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:47,377 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 137 transitions. [2019-01-31 17:06:47,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:47,377 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 137 transitions. [2019-01-31 17:06:47,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:47,378 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:47,378 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:47,378 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:47,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:47,379 INFO L82 PathProgramCache]: Analyzing trace with hash 28827822, now seen corresponding path program 1 times [2019-01-31 17:06:47,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:47,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:47,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:47,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:47,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:06:47,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:06:47,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 17:06:47,487 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:06:47,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:06:47,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:06:47,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:06:47,488 INFO L87 Difference]: Start difference. First operand 38 states and 137 transitions. Second operand 4 states. [2019-01-31 17:06:47,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:47,545 INFO L93 Difference]: Finished difference Result 51 states and 158 transitions. [2019-01-31 17:06:47,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:06:47,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-31 17:06:47,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:47,546 INFO L225 Difference]: With dead ends: 51 [2019-01-31 17:06:47,546 INFO L226 Difference]: Without dead ends: 46 [2019-01-31 17:06:47,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-31 17:06:47,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-31 17:06:47,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-01-31 17:06:47,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-31 17:06:47,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 145 transitions. [2019-01-31 17:06:47,561 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 145 transitions. Word has length 5 [2019-01-31 17:06:47,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:47,561 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 145 transitions. [2019-01-31 17:06:47,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:06:47,561 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 145 transitions. [2019-01-31 17:06:47,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:47,561 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:47,562 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:47,562 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:47,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:47,562 INFO L82 PathProgramCache]: Analyzing trace with hash 28818022, now seen corresponding path program 2 times [2019-01-31 17:06:47,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:47,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:47,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:47,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:47,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:47,763 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2019-01-31 17:06:47,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:47,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:47,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:47,803 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:06:47,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:06:47,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:47,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:47,813 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:06:47,814 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:06:47,819 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:06:47,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:06:47,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:47,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:47,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:06:47,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:06:47,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:06:47,869 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:47,886 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:47,895 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:47,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:47,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:06:48,256 WARN L181 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-31 17:06:48,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:06:48,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:06:48,379 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:48,388 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:48,395 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:48,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:48,436 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:06:48,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:06:48,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:48,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:48,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:06:48,712 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-31 17:06:48,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,857 INFO L303 Elim1Store]: Index analysis took 142 ms [2019-01-31 17:06:48,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-31 17:06:48,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:49,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:49,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-31 17:06:49,427 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-31 17:06:49,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,654 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:49,654 INFO L303 Elim1Store]: Index analysis took 224 ms [2019-01-31 17:06:49,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-31 17:06:49,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:49,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:49,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-31 17:06:49,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:49,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:49,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:49,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:49,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:06:49,787 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:49,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:06:49,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:06:49,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:06:49,788 INFO L87 Difference]: Start difference. First operand 39 states and 145 transitions. Second operand 10 states. [2019-01-31 17:06:50,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:50,583 INFO L93 Difference]: Finished difference Result 90 states and 270 transitions. [2019-01-31 17:06:50,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:06:50,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:06:50,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:50,585 INFO L225 Difference]: With dead ends: 90 [2019-01-31 17:06:50,585 INFO L226 Difference]: Without dead ends: 87 [2019-01-31 17:06:50,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:06:50,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-31 17:06:50,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 47. [2019-01-31 17:06:50,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-31 17:06:50,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 178 transitions. [2019-01-31 17:06:50,605 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 178 transitions. Word has length 5 [2019-01-31 17:06:50,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:50,605 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 178 transitions. [2019-01-31 17:06:50,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:06:50,605 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 178 transitions. [2019-01-31 17:06:50,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:50,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:50,606 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:50,606 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:50,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:50,606 INFO L82 PathProgramCache]: Analyzing trace with hash 28818148, now seen corresponding path program 1 times [2019-01-31 17:06:50,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:50,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:50,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:06:50,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:50,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:50,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:50,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:50,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:50,693 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:06:50,693 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [21] [2019-01-31 17:06:50,694 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:50,694 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:50,697 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:50,697 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:06:50,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:50,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:50,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:50,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:50,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:50,706 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:50,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:50,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:50,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:06:50,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:06:50,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:06:50,751 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:50,770 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:50,780 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:50,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:50,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:06:50,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:06:50,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:06:50,888 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:50,987 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:50,995 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:51,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:51,013 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-31 17:06:51,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:06:51,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:51,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:51,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-31 17:06:51,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-31 17:06:51,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:51,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:51,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-31 17:06:51,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:51,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:51,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:51,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:51,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:06:51,644 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:51,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:51,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:51,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:06:51,645 INFO L87 Difference]: Start difference. First operand 47 states and 178 transitions. Second operand 8 states. [2019-01-31 17:06:51,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:51,806 INFO L93 Difference]: Finished difference Result 66 states and 232 transitions. [2019-01-31 17:06:51,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:06:51,807 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:06:51,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:51,808 INFO L225 Difference]: With dead ends: 66 [2019-01-31 17:06:51,808 INFO L226 Difference]: Without dead ends: 65 [2019-01-31 17:06:51,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:51,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-31 17:06:51,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2019-01-31 17:06:51,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-31 17:06:51,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 209 transitions. [2019-01-31 17:06:51,829 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 209 transitions. Word has length 5 [2019-01-31 17:06:51,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:51,829 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 209 transitions. [2019-01-31 17:06:51,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:51,830 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 209 transitions. [2019-01-31 17:06:51,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:51,830 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:51,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:51,831 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:51,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:51,831 INFO L82 PathProgramCache]: Analyzing trace with hash 28821992, now seen corresponding path program 1 times [2019-01-31 17:06:51,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:51,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:51,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:51,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:51,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:51,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:06:51,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:51,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:51,907 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:06:51,908 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [21] [2019-01-31 17:06:51,908 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:51,909 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:51,912 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:51,912 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:06:51,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:51,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:51,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:51,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:51,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:51,922 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:51,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:51,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:06:51,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:06:52,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:06:52,016 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,027 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:52,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:06:52,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:06:52,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:06:52,059 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,073 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,082 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,090 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:52,273 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:06:52,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:06:52,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:52,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:06:52,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,338 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:52,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 53 [2019-01-31 17:06:52,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:52,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-31 17:06:52,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:52,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:52,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:52,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:52,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-31 17:06:52,417 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:52,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 17:06:52,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 17:06:52,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:06:52,418 INFO L87 Difference]: Start difference. First operand 53 states and 209 transitions. Second operand 7 states. [2019-01-31 17:06:52,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:52,640 INFO L93 Difference]: Finished difference Result 63 states and 221 transitions. [2019-01-31 17:06:52,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:06:52,642 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-01-31 17:06:52,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:52,642 INFO L225 Difference]: With dead ends: 63 [2019-01-31 17:06:52,642 INFO L226 Difference]: Without dead ends: 62 [2019-01-31 17:06:52,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:06:52,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-31 17:06:52,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2019-01-31 17:06:52,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-31 17:06:52,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 207 transitions. [2019-01-31 17:06:52,663 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 207 transitions. Word has length 5 [2019-01-31 17:06:52,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:52,663 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 207 transitions. [2019-01-31 17:06:52,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 17:06:52,664 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 207 transitions. [2019-01-31 17:06:52,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:52,664 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:52,664 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:52,665 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:52,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:52,665 INFO L82 PathProgramCache]: Analyzing trace with hash 28933468, now seen corresponding path program 2 times [2019-01-31 17:06:52,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:52,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:52,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:52,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:52,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:52,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:52,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:52,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:52,717 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:06:52,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:06:52,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:52,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:52,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:06:52,727 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:06:52,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-31 17:06:52,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:06:52,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:52,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:52,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:06:52,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:06:52,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:06:52,777 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,794 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,826 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:06:52,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:06:52,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:06:52,913 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,923 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,932 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:52,951 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-31 17:06:52,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:06:52,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:52,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:06:53,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:06:53,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:53,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:53,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-31 17:06:53,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:53,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:53,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:53,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:53,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:53,086 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:53,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:53,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:53,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:53,086 INFO L87 Difference]: Start difference. First operand 52 states and 207 transitions. Second operand 8 states. [2019-01-31 17:06:53,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:53,285 INFO L93 Difference]: Finished difference Result 86 states and 292 transitions. [2019-01-31 17:06:53,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:06:53,286 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:06:53,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:53,287 INFO L225 Difference]: With dead ends: 86 [2019-01-31 17:06:53,287 INFO L226 Difference]: Without dead ends: 85 [2019-01-31 17:06:53,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:06:53,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-31 17:06:53,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 61. [2019-01-31 17:06:53,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-31 17:06:53,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 254 transitions. [2019-01-31 17:06:53,316 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 254 transitions. Word has length 5 [2019-01-31 17:06:53,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:53,316 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 254 transitions. [2019-01-31 17:06:53,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:53,316 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 254 transitions. [2019-01-31 17:06:53,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:06:53,317 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:53,317 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-31 17:06:53,318 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:53,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:53,318 INFO L82 PathProgramCache]: Analyzing trace with hash 902762954, now seen corresponding path program 3 times [2019-01-31 17:06:53,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:53,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:53,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:06:53,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:53,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:53,377 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 17:06:53,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:53,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:53,378 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:06:53,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:06:53,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:53,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:53,394 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:06:53,395 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:06:53,398 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:06:53,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:06:53,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:53,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:06:53,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:06:53,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:06:53,488 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:53,496 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:53,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:53,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:53,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:06:53,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:06:53,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:06:53,528 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:53,542 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:53,552 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:53,559 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:53,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:53,576 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-31 17:06:53,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:06:53,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:53,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:53,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:06:53,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-01-31 17:06:53,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:53,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:53,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-01-31 17:06:53,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:06:53,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:53,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:53,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:06:53,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-31 17:06:53,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:53,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:53,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-31 17:06:53,772 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:53,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:53,813 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:53,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:53,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-01-31 17:06:53,839 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:53,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:06:53,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:06:53,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:06:53,840 INFO L87 Difference]: Start difference. First operand 61 states and 254 transitions. Second operand 10 states. [2019-01-31 17:06:54,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:54,301 INFO L93 Difference]: Finished difference Result 96 states and 318 transitions. [2019-01-31 17:06:54,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:06:54,302 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:06:54,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:54,303 INFO L225 Difference]: With dead ends: 96 [2019-01-31 17:06:54,303 INFO L226 Difference]: Without dead ends: 90 [2019-01-31 17:06:54,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:06:54,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-31 17:06:54,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2019-01-31 17:06:54,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-31 17:06:54,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 276 transitions. [2019-01-31 17:06:54,328 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 276 transitions. Word has length 6 [2019-01-31 17:06:54,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:54,328 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 276 transitions. [2019-01-31 17:06:54,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:06:54,329 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 276 transitions. [2019-01-31 17:06:54,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:06:54,329 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:54,329 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-31 17:06:54,329 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:54,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:54,329 INFO L82 PathProgramCache]: Analyzing trace with hash 902762768, now seen corresponding path program 3 times [2019-01-31 17:06:54,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:54,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:54,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:06:54,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:54,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:54,422 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:06:54,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:54,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:54,423 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:06:54,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:06:54,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:54,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:54,433 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:06:54,433 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:06:54,437 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:06:54,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:06:54,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:54,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:06:54,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:06:54,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:06:54,608 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:54,616 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:54,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:54,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:54,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:06:54,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:06:54,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:06:54,648 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:54,662 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:54,670 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:54,677 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:54,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:54,696 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:06:54,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:06:54,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:54,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:54,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:06:54,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-01-31 17:06:54,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:54,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:54,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-01-31 17:06:54,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:06:54,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:54,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:54,852 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:06:54,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-01-31 17:06:54,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:54,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:54,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-31 17:06:54,990 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:54,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:55,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:55,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:55,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:06:55,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:55,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:06:55,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:06:55,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:06:55,132 INFO L87 Difference]: Start difference. First operand 66 states and 276 transitions. Second operand 11 states. [2019-01-31 17:06:55,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:55,601 INFO L93 Difference]: Finished difference Result 107 states and 377 transitions. [2019-01-31 17:06:55,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:06:55,601 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-31 17:06:55,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:55,602 INFO L225 Difference]: With dead ends: 107 [2019-01-31 17:06:55,603 INFO L226 Difference]: Without dead ends: 106 [2019-01-31 17:06:55,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:06:55,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-31 17:06:55,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2019-01-31 17:06:55,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-31 17:06:55,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 321 transitions. [2019-01-31 17:06:55,634 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 321 transitions. Word has length 6 [2019-01-31 17:06:55,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:55,634 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 321 transitions. [2019-01-31 17:06:55,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:06:55,634 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 321 transitions. [2019-01-31 17:06:55,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:06:55,635 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:55,635 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-31 17:06:55,635 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:55,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:55,635 INFO L82 PathProgramCache]: Analyzing trace with hash 902474468, now seen corresponding path program 4 times [2019-01-31 17:06:55,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:55,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:55,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:06:55,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:55,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:55,994 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:06:55,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:55,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:55,995 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:06:55,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:06:55,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:55,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:56,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:56,004 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:56,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:56,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:56,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:06:56,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:06:56,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:06:56,036 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:56,053 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:56,063 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:56,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:56,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:06:56,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:06:56,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:06:56,151 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:56,159 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:56,168 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:56,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:56,186 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:06:56,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:06:56,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:56,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:56,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:06:56,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:06:56,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:56,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:56,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-01-31 17:06:56,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-31 17:06:56,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:56,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:56,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:25 [2019-01-31 17:06:56,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-01-31 17:06:56,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:56,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:56,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-31 17:06:56,400 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:56,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:56,450 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:56,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:56,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:06:56,469 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:56,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:06:56,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:06:56,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:06:56,470 INFO L87 Difference]: Start difference. First operand 75 states and 321 transitions. Second operand 11 states. [2019-01-31 17:06:56,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:56,865 INFO L93 Difference]: Finished difference Result 116 states and 391 transitions. [2019-01-31 17:06:56,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:06:56,866 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-31 17:06:56,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:56,867 INFO L225 Difference]: With dead ends: 116 [2019-01-31 17:06:56,868 INFO L226 Difference]: Without dead ends: 113 [2019-01-31 17:06:56,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:06:56,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-31 17:06:56,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 51. [2019-01-31 17:06:56,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-31 17:06:56,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 198 transitions. [2019-01-31 17:06:56,891 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 198 transitions. Word has length 6 [2019-01-31 17:06:56,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:56,891 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 198 transitions. [2019-01-31 17:06:56,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:06:56,891 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 198 transitions. [2019-01-31 17:06:56,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:06:56,892 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:56,892 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:06:56,892 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:56,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:56,892 INFO L82 PathProgramCache]: Analyzing trace with hash 902478688, now seen corresponding path program 1 times [2019-01-31 17:06:56,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:56,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:56,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:56,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:56,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:56,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:06:56,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:56,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:56,954 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:06:56,954 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [23] [2019-01-31 17:06:56,955 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:56,955 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:56,959 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:56,960 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:06:56,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:56,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:56,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:56,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:56,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:56,969 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:56,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:57,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:57,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:06:57,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:06:57,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:06:57,018 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,037 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,047 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:06:57,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:06:57,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:06:57,169 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,177 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,186 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:57,204 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:06:57,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:06:57,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:57,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:06:57,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:06:57,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:57,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-31 17:06:57,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:57,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:57,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:57,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:57,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:06:57,350 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:57,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:57,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:57,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:06:57,351 INFO L87 Difference]: Start difference. First operand 51 states and 198 transitions. Second operand 8 states. [2019-01-31 17:06:57,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:57,613 INFO L93 Difference]: Finished difference Result 72 states and 235 transitions. [2019-01-31 17:06:57,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:06:57,614 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:06:57,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:57,615 INFO L225 Difference]: With dead ends: 72 [2019-01-31 17:06:57,615 INFO L226 Difference]: Without dead ends: 67 [2019-01-31 17:06:57,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:06:57,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-31 17:06:57,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2019-01-31 17:06:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-31 17:06:57,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 214 transitions. [2019-01-31 17:06:57,640 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 214 transitions. Word has length 6 [2019-01-31 17:06:57,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:57,640 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 214 transitions. [2019-01-31 17:06:57,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:57,640 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 214 transitions. [2019-01-31 17:06:57,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:06:57,641 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:57,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:06:57,641 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:57,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:57,641 INFO L82 PathProgramCache]: Analyzing trace with hash 902469014, now seen corresponding path program 1 times [2019-01-31 17:06:57,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:57,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:57,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:57,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:57,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:57,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:06:57,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:57,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:57,714 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:06:57,714 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [21] [2019-01-31 17:06:57,716 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:57,716 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:57,718 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:57,719 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:06:57,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:57,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:57,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:57,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:57,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:57,727 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:57,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:57,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:57,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:06:57,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:06:57,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:06:57,780 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,797 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,807 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:06:57,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:06:57,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:06:57,893 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,901 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,910 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:57,929 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:06:57,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:06:57,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:57,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:06:57,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:06:57,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:58,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-31 17:06:58,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,040 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:58,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-31 17:06:58,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:58,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-31 17:06:58,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:58,104 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:58,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:58,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:58,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:06:58,148 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:58,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:06:58,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:06:58,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:06:58,148 INFO L87 Difference]: Start difference. First operand 55 states and 214 transitions. Second operand 10 states. [2019-01-31 17:06:58,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:58,503 INFO L93 Difference]: Finished difference Result 77 states and 249 transitions. [2019-01-31 17:06:58,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:06:58,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:06:58,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:58,504 INFO L225 Difference]: With dead ends: 77 [2019-01-31 17:06:58,505 INFO L226 Difference]: Without dead ends: 76 [2019-01-31 17:06:58,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:06:58,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-31 17:06:58,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-01-31 17:06:58,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-31 17:06:58,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 213 transitions. [2019-01-31 17:06:58,535 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 213 transitions. Word has length 6 [2019-01-31 17:06:58,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:58,535 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 213 transitions. [2019-01-31 17:06:58,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:06:58,536 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 213 transitions. [2019-01-31 17:06:58,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:06:58,536 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:58,536 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:06:58,536 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:58,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:58,536 INFO L82 PathProgramCache]: Analyzing trace with hash 902472858, now seen corresponding path program 1 times [2019-01-31 17:06:58,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:58,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:58,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:58,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:58,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:58,681 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-31 17:06:58,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:06:58,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:58,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:58,718 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:06:58,718 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [21] [2019-01-31 17:06:58,719 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:58,719 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:58,722 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:58,723 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:06:58,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:58,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:58,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:58,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:58,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:58,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:58,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:58,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:58,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:06:58,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:06:58,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:06:58,801 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,819 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,829 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:06:58,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:06:58,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:06:58,920 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,930 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,937 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,956 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-31 17:06:58,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:06:58,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:59,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:06:59,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:06:59,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:59,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:06:59,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,184 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:59,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-31 17:06:59,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:59,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-31 17:06:59,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:59,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:59,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:59,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:59,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:06:59,288 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:59,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:06:59,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:06:59,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:06:59,288 INFO L87 Difference]: Start difference. First operand 55 states and 213 transitions. Second operand 10 states. [2019-01-31 17:06:59,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:59,631 INFO L93 Difference]: Finished difference Result 78 states and 272 transitions. [2019-01-31 17:06:59,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:06:59,632 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:06:59,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:59,633 INFO L225 Difference]: With dead ends: 78 [2019-01-31 17:06:59,633 INFO L226 Difference]: Without dead ends: 77 [2019-01-31 17:06:59,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:06:59,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-31 17:06:59,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 59. [2019-01-31 17:06:59,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-31 17:06:59,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 238 transitions. [2019-01-31 17:06:59,670 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 238 transitions. Word has length 6 [2019-01-31 17:06:59,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:59,671 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 238 transitions. [2019-01-31 17:06:59,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:06:59,671 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 238 transitions. [2019-01-31 17:06:59,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:06:59,671 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:59,671 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-31 17:06:59,672 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:59,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:59,672 INFO L82 PathProgramCache]: Analyzing trace with hash 902712672, now seen corresponding path program 1 times [2019-01-31 17:06:59,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:59,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:59,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:59,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:59,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:59,774 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:06:59,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:59,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:59,775 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:06:59,775 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2019-01-31 17:06:59,778 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:59,778 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:59,781 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:59,781 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:06:59,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:59,782 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:59,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:59,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:59,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:59,791 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:59,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:59,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:06:59,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:06:59,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:06:59,875 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,883 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:59,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:06:59,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:06:59,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:06:59,916 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,929 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,936 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,942 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:59,961 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:06:59,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:06:59,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:00,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:07:00,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-31 17:07:00,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:00,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:00,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:07:00,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-31 17:07:00,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:00,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:00,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-31 17:07:00,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,141 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:00,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-01-31 17:07:00,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:00,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:00,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-31 17:07:00,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:00,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:00,336 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:00,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:00,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:07:00,356 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:00,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:07:00,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:07:00,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:00,357 INFO L87 Difference]: Start difference. First operand 59 states and 238 transitions. Second operand 11 states. [2019-01-31 17:07:00,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:00,881 INFO L93 Difference]: Finished difference Result 95 states and 298 transitions. [2019-01-31 17:07:00,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:07:00,882 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-31 17:07:00,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:00,883 INFO L225 Difference]: With dead ends: 95 [2019-01-31 17:07:00,884 INFO L226 Difference]: Without dead ends: 90 [2019-01-31 17:07:00,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:07:00,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-31 17:07:00,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2019-01-31 17:07:00,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-31 17:07:00,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 247 transitions. [2019-01-31 17:07:00,921 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 247 transitions. Word has length 6 [2019-01-31 17:07:00,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:00,921 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 247 transitions. [2019-01-31 17:07:00,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:07:00,921 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 247 transitions. [2019-01-31 17:07:00,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:00,922 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:00,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:00,922 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:00,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:00,922 INFO L82 PathProgramCache]: Analyzing trace with hash 893362642, now seen corresponding path program 1 times [2019-01-31 17:07:00,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:00,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:00,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:00,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:00,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:01,100 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:07:01,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:07:01,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:01,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:01,291 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:01,291 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [23] [2019-01-31 17:07:01,293 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:01,293 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:01,295 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:01,296 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:01,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:01,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:01,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:01,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:01,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:01,308 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:01,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:01,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:07:01,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:07:01,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:07:01,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:07:01,427 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:01,506 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:01,515 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:01,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:01,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:07:01,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:07:01,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:07:01,601 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:01,611 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:01,620 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:01,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:01,638 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:07:01,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:07:01,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:01,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:01,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:07:01,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-31 17:07:01,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:01,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:01,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-31 17:07:01,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:01,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:01,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:01,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:01,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-31 17:07:01,780 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:01,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:07:01,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:07:01,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:01,781 INFO L87 Difference]: Start difference. First operand 61 states and 247 transitions. Second operand 9 states. [2019-01-31 17:07:02,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:02,754 INFO L93 Difference]: Finished difference Result 90 states and 328 transitions. [2019-01-31 17:07:02,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:02,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-31 17:07:02,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:02,756 INFO L225 Difference]: With dead ends: 90 [2019-01-31 17:07:02,756 INFO L226 Difference]: Without dead ends: 87 [2019-01-31 17:07:02,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:02,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-31 17:07:02,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 72. [2019-01-31 17:07:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-31 17:07:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 308 transitions. [2019-01-31 17:07:02,798 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 308 transitions. Word has length 6 [2019-01-31 17:07:02,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:02,799 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 308 transitions. [2019-01-31 17:07:02,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:07:02,799 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 308 transitions. [2019-01-31 17:07:02,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:02,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:02,799 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:02,799 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:02,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:02,800 INFO L82 PathProgramCache]: Analyzing trace with hash 893472132, now seen corresponding path program 1 times [2019-01-31 17:07:02,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:02,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:02,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:02,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:02,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:03,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:07:03,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:03,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:03,365 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:03,366 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [21] [2019-01-31 17:07:03,370 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:03,370 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:03,375 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:03,375 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:07:03,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:03,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:03,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:03,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:03,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:03,412 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:03,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:03,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:07:03,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:07:03,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:07:03,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-31 17:07:03,548 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,558 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,567 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-31 17:07:03,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-31 17:07:03,614 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,619 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:03,632 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2019-01-31 17:07:03,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-31 17:07:03,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:03,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-31 17:07:03,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,688 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:03,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:07:03,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:03,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-31 17:07:03,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:07:03,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:03,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-31 17:07:03,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:03,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:03,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:03,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:07:03,809 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:03,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:03,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:03,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:03,810 INFO L87 Difference]: Start difference. First operand 72 states and 308 transitions. Second operand 10 states. [2019-01-31 17:07:04,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:04,131 INFO L93 Difference]: Finished difference Result 122 states and 469 transitions. [2019-01-31 17:07:04,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:07:04,132 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:07:04,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:04,133 INFO L225 Difference]: With dead ends: 122 [2019-01-31 17:07:04,133 INFO L226 Difference]: Without dead ends: 121 [2019-01-31 17:07:04,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:04,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-31 17:07:04,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2019-01-31 17:07:04,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-31 17:07:04,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 434 transitions. [2019-01-31 17:07:04,189 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 434 transitions. Word has length 6 [2019-01-31 17:07:04,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:04,189 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 434 transitions. [2019-01-31 17:07:04,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:04,189 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 434 transitions. [2019-01-31 17:07:04,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:04,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:04,190 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:04,190 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:04,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:04,190 INFO L82 PathProgramCache]: Analyzing trace with hash 897235472, now seen corresponding path program 1 times [2019-01-31 17:07:04,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:04,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:04,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:04,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:04,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:04,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:07:04,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:04,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:04,278 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:04,278 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [23] [2019-01-31 17:07:04,279 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:04,279 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:04,283 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:04,284 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:04,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:04,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:04,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:04,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:04,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:04,299 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:04,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:04,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-31 17:07:04,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-31 17:07:04,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-31 17:07:04,380 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,389 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:07:04,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-31 17:07:04,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-01-31 17:07:04,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-31 17:07:04,425 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,438 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,446 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,454 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:04,469 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-01-31 17:07:04,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-31 17:07:04,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:04,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-31 17:07:04,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,530 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:04,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2019-01-31 17:07:04,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:04,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-31 17:07:04,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:04,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:04,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:04,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:04,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:04,596 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:04,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:04,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:04,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:04,597 INFO L87 Difference]: Start difference. First operand 96 states and 434 transitions. Second operand 8 states. [2019-01-31 17:07:04,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:04,820 INFO L93 Difference]: Finished difference Result 113 states and 457 transitions. [2019-01-31 17:07:04,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:04,821 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:07:04,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:04,822 INFO L225 Difference]: With dead ends: 113 [2019-01-31 17:07:04,823 INFO L226 Difference]: Without dead ends: 108 [2019-01-31 17:07:04,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:04,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-31 17:07:04,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2019-01-31 17:07:04,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-31 17:07:04,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 438 transitions. [2019-01-31 17:07:04,879 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 438 transitions. Word has length 6 [2019-01-31 17:07:04,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:04,880 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 438 transitions. [2019-01-31 17:07:04,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:04,880 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 438 transitions. [2019-01-31 17:07:04,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:04,881 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:04,881 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:04,881 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:04,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:04,881 INFO L82 PathProgramCache]: Analyzing trace with hash 896931732, now seen corresponding path program 2 times [2019-01-31 17:07:04,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:04,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:04,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:04,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:04,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:05,176 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-31 17:07:05,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:07:05,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:05,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:05,299 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:05,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:05,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:05,299 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:05,308 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:07:05,308 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:07:05,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:07:05,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:05,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:05,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:07:05,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:07:05,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:07:05,421 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:05,444 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:05,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:05,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:07:05,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:07:05,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:07:05,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:07:05,491 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:05,517 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:05,600 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:05,607 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:05,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:05,626 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:07:05,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:07:05,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:05,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:05,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:07:05,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:07:05,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:05,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:05,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:07:05,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,826 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:05,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 71 [2019-01-31 17:07:05,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:05,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:05,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-31 17:07:05,868 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:05,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:05,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:05,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:05,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-31 17:07:05,923 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:05,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:07:05,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:07:05,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:05,924 INFO L87 Difference]: Start difference. First operand 97 states and 438 transitions. Second operand 9 states. [2019-01-31 17:07:06,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:06,266 INFO L93 Difference]: Finished difference Result 137 states and 550 transitions. [2019-01-31 17:07:06,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:06,266 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-31 17:07:06,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:06,267 INFO L225 Difference]: With dead ends: 137 [2019-01-31 17:07:06,267 INFO L226 Difference]: Without dead ends: 136 [2019-01-31 17:07:06,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:07:06,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-31 17:07:06,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-01-31 17:07:06,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-31 17:07:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 421 transitions. [2019-01-31 17:07:06,326 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 421 transitions. Word has length 6 [2019-01-31 17:07:06,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:06,326 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 421 transitions. [2019-01-31 17:07:06,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:07:06,327 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 421 transitions. [2019-01-31 17:07:06,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:06,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:06,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:06,328 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:06,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:06,328 INFO L82 PathProgramCache]: Analyzing trace with hash 900929556, now seen corresponding path program 1 times [2019-01-31 17:07:06,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:06,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:06,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:06,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:06,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:06,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:06,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:06,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:06,364 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:06,365 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [23] [2019-01-31 17:07:06,367 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:06,367 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:06,369 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:06,370 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:06,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:06,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:06,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:06,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:06,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:06,384 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:06,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:06,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-01-31 17:07:06,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2019-01-31 17:07:06,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2019-01-31 17:07:06,434 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,439 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:07:06,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-31 17:07:06,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-01-31 17:07:06,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-31 17:07:06,469 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,480 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,487 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,495 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:06,507 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:30, output treesize:33 [2019-01-31 17:07:06,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-31 17:07:06,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-31 17:07:06,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:07:06,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:06,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-01-31 17:07:06,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:06,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:06,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:06,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:06,780 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:06,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:06,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:06,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:06,780 INFO L87 Difference]: Start difference. First operand 93 states and 421 transitions. Second operand 8 states. [2019-01-31 17:07:06,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:06,983 INFO L93 Difference]: Finished difference Result 110 states and 439 transitions. [2019-01-31 17:07:06,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:06,984 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:07:06,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:06,986 INFO L225 Difference]: With dead ends: 110 [2019-01-31 17:07:06,986 INFO L226 Difference]: Without dead ends: 109 [2019-01-31 17:07:06,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:07:06,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-31 17:07:07,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2019-01-31 17:07:07,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-31 17:07:07,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 406 transitions. [2019-01-31 17:07:07,035 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 406 transitions. Word has length 6 [2019-01-31 17:07:07,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:07,036 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 406 transitions. [2019-01-31 17:07:07,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:07,036 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 406 transitions. [2019-01-31 17:07:07,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:07,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:07,036 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-31 17:07:07,037 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:07,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:07,037 INFO L82 PathProgramCache]: Analyzing trace with hash 900915912, now seen corresponding path program 2 times [2019-01-31 17:07:07,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:07,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:07,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:07,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:07,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:07,139 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:07:07,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:07,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:07,139 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:07,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:07,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:07,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:07,148 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:07:07,148 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:07:07,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:07:07,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:07,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:07,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:07:07,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:07:07,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:07:07,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:07:07,188 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,206 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,216 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:07:07,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:07:07,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:07:07,305 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,314 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,323 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:07,342 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:07:07,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:07:07,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:07,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:07:07,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-31 17:07:07,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:07,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-31 17:07:07,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,453 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:07,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-01-31 17:07:07,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:07,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-31 17:07:07,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-31 17:07:07,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:07,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-31 17:07:07,572 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:07,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:07,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:07,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:07,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-31 17:07:07,629 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:07,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:07:07,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:07:07,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:07:07,630 INFO L87 Difference]: Start difference. First operand 90 states and 406 transitions. Second operand 11 states. [2019-01-31 17:07:08,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:08,051 INFO L93 Difference]: Finished difference Result 124 states and 476 transitions. [2019-01-31 17:07:08,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:07:08,051 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-31 17:07:08,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:08,053 INFO L225 Difference]: With dead ends: 124 [2019-01-31 17:07:08,053 INFO L226 Difference]: Without dead ends: 116 [2019-01-31 17:07:08,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:07:08,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-31 17:07:08,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2019-01-31 17:07:08,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-31 17:07:08,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 435 transitions. [2019-01-31 17:07:08,114 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 435 transitions. Word has length 6 [2019-01-31 17:07:08,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:08,114 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 435 transitions. [2019-01-31 17:07:08,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:07:08,114 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 435 transitions. [2019-01-31 17:07:08,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:08,115 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:08,115 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:08,115 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:08,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:08,115 INFO L82 PathProgramCache]: Analyzing trace with hash 900919446, now seen corresponding path program 1 times [2019-01-31 17:07:08,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:08,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:08,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:08,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:08,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:08,186 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:08,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:08,187 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:08,187 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:08,187 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2019-01-31 17:07:08,188 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:08,188 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:08,190 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:08,191 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:07:08,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:08,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:08,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:08,191 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:08,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:08,199 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:08,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:08,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:07:08,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:07:08,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:07:08,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:07:08,275 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,291 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,301 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:07:08,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:07:08,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:07:08,412 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,422 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,428 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,447 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-31 17:07:08,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:07:08,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:08,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:07:08,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-31 17:07:08,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:08,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-31 17:07:08,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,569 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:08,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-31 17:07:08,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:08,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-31 17:07:08,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,622 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:08,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-31 17:07:08,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:08,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-31 17:07:08,667 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:08,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:08,711 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:08,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:08,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:07:08,730 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:08,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:07:08,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:07:08,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:08,730 INFO L87 Difference]: Start difference. First operand 97 states and 435 transitions. Second operand 12 states. [2019-01-31 17:07:09,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:09,247 INFO L93 Difference]: Finished difference Result 137 states and 564 transitions. [2019-01-31 17:07:09,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:07:09,248 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:07:09,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:09,250 INFO L225 Difference]: With dead ends: 137 [2019-01-31 17:07:09,250 INFO L226 Difference]: Without dead ends: 136 [2019-01-31 17:07:09,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:07:09,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-31 17:07:09,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2019-01-31 17:07:09,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-31 17:07:09,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 465 transitions. [2019-01-31 17:07:09,311 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 465 transitions. Word has length 6 [2019-01-31 17:07:09,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:09,311 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 465 transitions. [2019-01-31 17:07:09,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:07:09,311 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 465 transitions. [2019-01-31 17:07:09,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:09,312 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:09,312 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:09,312 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:09,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:09,312 INFO L82 PathProgramCache]: Analyzing trace with hash 900627426, now seen corresponding path program 2 times [2019-01-31 17:07:09,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:09,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:09,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:09,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:09,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:09,428 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:09,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:09,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:09,429 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:09,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:09,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:09,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:09,437 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:07:09,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:07:09,442 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:07:09,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:09,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:09,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:07:09,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:07:09,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:07:09,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:07:09,488 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,504 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,514 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:07:09,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:07:09,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:07:09,644 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,654 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,662 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,681 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-31 17:07:09,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:07:09,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:09,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:07:09,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,779 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:09,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-31 17:07:09,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:09,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2019-01-31 17:07:09,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-31 17:07:09,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:09,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2019-01-31 17:07:09,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,889 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:09,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-31 17:07:09,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:09,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-01-31 17:07:09,933 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:09,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:09,987 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:10,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:10,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:07:10,008 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:10,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:07:10,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:07:10,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:10,009 INFO L87 Difference]: Start difference. First operand 103 states and 465 transitions. Second operand 12 states. [2019-01-31 17:07:10,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:10,683 INFO L93 Difference]: Finished difference Result 172 states and 721 transitions. [2019-01-31 17:07:10,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:07:10,684 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:07:10,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:10,687 INFO L225 Difference]: With dead ends: 172 [2019-01-31 17:07:10,687 INFO L226 Difference]: Without dead ends: 167 [2019-01-31 17:07:10,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:07:10,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-01-31 17:07:10,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 116. [2019-01-31 17:07:10,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-31 17:07:10,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 529 transitions. [2019-01-31 17:07:10,739 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 529 transitions. Word has length 6 [2019-01-31 17:07:10,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:10,739 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 529 transitions. [2019-01-31 17:07:10,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:07:10,739 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 529 transitions. [2019-01-31 17:07:10,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:10,740 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:10,740 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:10,740 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:10,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:10,740 INFO L82 PathProgramCache]: Analyzing trace with hash 900621846, now seen corresponding path program 3 times [2019-01-31 17:07:10,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:10,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:10,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:10,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:10,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:10,940 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:10,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:10,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:10,941 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:10,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:10,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:10,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:10,951 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:07:10,951 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:07:10,956 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:07:10,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:10,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:10,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:07:10,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:07:11,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:07:11,032 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,042 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:07:11,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:07:11,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:07:11,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:07:11,074 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,088 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,097 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,105 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,122 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-31 17:07:11,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:07:11,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:11,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:07:11,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,231 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:11,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-31 17:07:11,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:11,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2019-01-31 17:07:11,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-31 17:07:11,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:11,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2019-01-31 17:07:11,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,327 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:11,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-31 17:07:11,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:11,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:31 [2019-01-31 17:07:11,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:11,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:11,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:11,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:07:11,443 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:11,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:07:11,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:07:11,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:07:11,443 INFO L87 Difference]: Start difference. First operand 116 states and 529 transitions. Second operand 12 states. [2019-01-31 17:07:11,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:11,898 INFO L93 Difference]: Finished difference Result 140 states and 566 transitions. [2019-01-31 17:07:11,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:07:11,899 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:07:11,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:11,901 INFO L225 Difference]: With dead ends: 140 [2019-01-31 17:07:11,901 INFO L226 Difference]: Without dead ends: 135 [2019-01-31 17:07:11,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:07:11,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-31 17:07:11,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 46. [2019-01-31 17:07:11,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-31 17:07:11,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 176 transitions. [2019-01-31 17:07:11,939 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 176 transitions. Word has length 6 [2019-01-31 17:07:11,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:11,939 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 176 transitions. [2019-01-31 17:07:11,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:07:11,940 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 176 transitions. [2019-01-31 17:07:11,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:07:11,940 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:11,940 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:11,940 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:11,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:11,940 INFO L82 PathProgramCache]: Analyzing trace with hash -2088231584, now seen corresponding path program 1 times [2019-01-31 17:07:11,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:11,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:11,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:11,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:11,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:12,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:07:12,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:12,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:12,072 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:07:12,072 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [23] [2019-01-31 17:07:12,073 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:12,073 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:12,075 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:12,076 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:07:12,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:12,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:12,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:12,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:12,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:12,086 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:12,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:12,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:07:12,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:07:12,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:07:12,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:07:12,127 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,144 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,154 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:07:12,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:07:12,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:07:12,238 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,246 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,267 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,284 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-31 17:07:12,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:07:12,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:12,328 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:07:12,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:07:12,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:12,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:07:12,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,403 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:12,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-31 17:07:12,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:12,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-31 17:07:12,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:12,447 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:12,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:12,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:12,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:07:12,499 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:12,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:12,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:12,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:12,499 INFO L87 Difference]: Start difference. First operand 46 states and 176 transitions. Second operand 10 states. [2019-01-31 17:07:12,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:12,945 INFO L93 Difference]: Finished difference Result 77 states and 262 transitions. [2019-01-31 17:07:12,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:07:12,946 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:07:12,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:12,947 INFO L225 Difference]: With dead ends: 77 [2019-01-31 17:07:12,947 INFO L226 Difference]: Without dead ends: 76 [2019-01-31 17:07:12,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:07:12,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-31 17:07:13,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2019-01-31 17:07:13,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-31 17:07:13,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 213 transitions. [2019-01-31 17:07:13,004 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 213 transitions. Word has length 7 [2019-01-31 17:07:13,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:13,005 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 213 transitions. [2019-01-31 17:07:13,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:13,005 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 213 transitions. [2019-01-31 17:07:13,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:07:13,005 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:13,005 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:13,006 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:13,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:13,006 INFO L82 PathProgramCache]: Analyzing trace with hash -2088122094, now seen corresponding path program 1 times [2019-01-31 17:07:13,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:13,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:13,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:13,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:13,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:07:13,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:13,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:13,126 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:07:13,126 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [21] [2019-01-31 17:07:13,129 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:13,129 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:13,132 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:13,132 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:07:13,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:13,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:13,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:13,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:13,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:13,141 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:13,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:13,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:07:13,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:07:13,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:07:13,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:07:13,174 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,192 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,202 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:07:13,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:07:13,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:07:13,297 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,305 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,313 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,332 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-31 17:07:13,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:07:13,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:13,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:07:13,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:07:13,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:13,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:07:13,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,455 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:13,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-31 17:07:13,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:13,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-31 17:07:13,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,518 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:13,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-31 17:07:13,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:13,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-01-31 17:07:13,564 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:13,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:13,606 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:13,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:13,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:07:13,624 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:13,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:07:13,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:07:13,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:13,625 INFO L87 Difference]: Start difference. First operand 54 states and 213 transitions. Second operand 12 states. [2019-01-31 17:07:14,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:14,192 INFO L93 Difference]: Finished difference Result 86 states and 270 transitions. [2019-01-31 17:07:14,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:07:14,192 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-31 17:07:14,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:14,193 INFO L225 Difference]: With dead ends: 86 [2019-01-31 17:07:14,193 INFO L226 Difference]: Without dead ends: 85 [2019-01-31 17:07:14,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:07:14,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-31 17:07:14,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 53. [2019-01-31 17:07:14,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-31 17:07:14,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 208 transitions. [2019-01-31 17:07:14,259 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 208 transitions. Word has length 7 [2019-01-31 17:07:14,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:14,259 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 208 transitions. [2019-01-31 17:07:14,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:07:14,259 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 208 transitions. [2019-01-31 17:07:14,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:07:14,260 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:14,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:14,260 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:14,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:14,260 INFO L82 PathProgramCache]: Analyzing trace with hash -2084237604, now seen corresponding path program 1 times [2019-01-31 17:07:14,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:14,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:14,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:14,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:14,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:14,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:14,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:14,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:14,463 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:07:14,464 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [24], [25] [2019-01-31 17:07:14,465 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:14,465 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:14,467 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:14,467 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:14,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:14,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:14,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:14,468 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:14,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:14,476 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:14,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:14,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:07:14,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-31 17:07:14,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-01-31 17:07:14,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-01-31 17:07:14,498 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,504 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,511 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:14,527 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:15, output treesize:21 [2019-01-31 17:07:14,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 15 [2019-01-31 17:07:14,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:07:14,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-31 17:07:14,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:21 [2019-01-31 17:07:14,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2019-01-31 17:07:14,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,594 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:14,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2019-01-31 17:07:14,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-31 17:07:14,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:21 [2019-01-31 17:07:14,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:14,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:14,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:14,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:07:14,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 9 [2019-01-31 17:07:14,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:07:14,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 17:07:14,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 17:07:14,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:14,656 INFO L87 Difference]: Start difference. First operand 53 states and 208 transitions. Second operand 5 states. [2019-01-31 17:07:14,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:14,870 INFO L93 Difference]: Finished difference Result 115 states and 427 transitions. [2019-01-31 17:07:14,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:07:14,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-31 17:07:14,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:14,872 INFO L225 Difference]: With dead ends: 115 [2019-01-31 17:07:14,872 INFO L226 Difference]: Without dead ends: 110 [2019-01-31 17:07:14,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:14,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-31 17:07:14,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2019-01-31 17:07:14,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-31 17:07:14,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 343 transitions. [2019-01-31 17:07:14,980 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 343 transitions. Word has length 7 [2019-01-31 17:07:14,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:14,980 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 343 transitions. [2019-01-31 17:07:14,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 17:07:14,980 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 343 transitions. [2019-01-31 17:07:14,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:07:14,981 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:14,981 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:14,981 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:14,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:14,981 INFO L82 PathProgramCache]: Analyzing trace with hash -2084662494, now seen corresponding path program 2 times [2019-01-31 17:07:14,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:14,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:14,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:14,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:14,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:15,380 WARN L181 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2019-01-31 17:07:15,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:07:15,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:15,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:15,542 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:15,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:15,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:15,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:15,551 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:07:15,551 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:07:15,556 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:07:15,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:15,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:15,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:07:15,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:07:15,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:07:15,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:07:15,597 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,621 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,634 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:07:15,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:07:15,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:07:15,755 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,770 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,783 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,806 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-31 17:07:15,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:07:15,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:15,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:07:15,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,904 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:15,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-31 17:07:15,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:15,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-01-31 17:07:15,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-31 17:07:15,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:15,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-31 17:07:15,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,000 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:16,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-31 17:07:16,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:16,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:16,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-31 17:07:16,048 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:16,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:16,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:16,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:16,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:07:16,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:16,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:07:16,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:07:16,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:16,114 INFO L87 Difference]: Start difference. First operand 84 states and 343 transitions. Second operand 11 states. [2019-01-31 17:07:16,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:16,702 INFO L93 Difference]: Finished difference Result 104 states and 372 transitions. [2019-01-31 17:07:16,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:07:16,702 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-31 17:07:16,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:16,704 INFO L225 Difference]: With dead ends: 104 [2019-01-31 17:07:16,704 INFO L226 Difference]: Without dead ends: 103 [2019-01-31 17:07:16,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:07:16,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-31 17:07:16,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 47. [2019-01-31 17:07:16,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-31 17:07:16,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 177 transitions. [2019-01-31 17:07:16,804 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 177 transitions. Word has length 7 [2019-01-31 17:07:16,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:16,805 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 177 transitions. [2019-01-31 17:07:16,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:07:16,805 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 177 transitions. [2019-01-31 17:07:16,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:07:16,805 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:16,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:16,805 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:16,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:16,805 INFO L82 PathProgramCache]: Analyzing trace with hash -2080843416, now seen corresponding path program 1 times [2019-01-31 17:07:16,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:16,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:16,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:16,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:16,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:16,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:16,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:16,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:16,937 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:07:16,937 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [22], [23] [2019-01-31 17:07:16,938 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:16,938 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:16,941 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:16,941 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:07:16,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:16,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:16,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:16,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:16,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:16,952 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:16,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:16,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:07:16,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-31 17:07:16,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-01-31 17:07:16,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-31 17:07:16,987 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,002 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,011 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-31 17:07:17,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-31 17:07:17,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-31 17:07:17,081 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,090 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,098 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:17,115 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-01-31 17:07:17,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-31 17:07:17,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:17,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-31 17:07:17,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:07:17,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:17,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-01-31 17:07:17,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,209 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:17,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 55 [2019-01-31 17:07:17,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:17,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:20 [2019-01-31 17:07:17,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:17,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:17,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:17,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:17,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:07:17,295 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:17,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:17,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:17,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:17,296 INFO L87 Difference]: Start difference. First operand 47 states and 177 transitions. Second operand 10 states. [2019-01-31 17:07:17,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:17,703 INFO L93 Difference]: Finished difference Result 68 states and 235 transitions. [2019-01-31 17:07:17,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:17,704 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:07:17,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:17,705 INFO L225 Difference]: With dead ends: 68 [2019-01-31 17:07:17,705 INFO L226 Difference]: Without dead ends: 67 [2019-01-31 17:07:17,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:17,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-31 17:07:17,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-01-31 17:07:17,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-31 17:07:17,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 190 transitions. [2019-01-31 17:07:17,870 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 190 transitions. Word has length 7 [2019-01-31 17:07:17,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:17,871 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 190 transitions. [2019-01-31 17:07:17,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:17,871 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 190 transitions. [2019-01-31 17:07:17,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:07:17,871 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:17,871 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-31 17:07:17,872 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:17,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:17,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1920744098, now seen corresponding path program 1 times [2019-01-31 17:07:17,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:17,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:17,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:17,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:17,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:18,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 17:07:18,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:07:18,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 17:07:18,084 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:07:18,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:07:18,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:07:18,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:07:18,085 INFO L87 Difference]: Start difference. First operand 50 states and 190 transitions. Second operand 4 states. [2019-01-31 17:07:18,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:18,228 INFO L93 Difference]: Finished difference Result 54 states and 193 transitions. [2019-01-31 17:07:18,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:07:18,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-31 17:07:18,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:18,229 INFO L225 Difference]: With dead ends: 54 [2019-01-31 17:07:18,230 INFO L226 Difference]: Without dead ends: 50 [2019-01-31 17:07:18,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:07:18,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-31 17:07:18,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-31 17:07:18,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-31 17:07:18,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 189 transitions. [2019-01-31 17:07:18,380 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 189 transitions. Word has length 7 [2019-01-31 17:07:18,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:18,380 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 189 transitions. [2019-01-31 17:07:18,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:07:18,380 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 189 transitions. [2019-01-31 17:07:18,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:07:18,381 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:18,381 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:18,382 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:18,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:18,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1928011116, now seen corresponding path program 1 times [2019-01-31 17:07:18,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:18,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:18,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:18,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:18,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:18,523 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-31 17:07:18,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:07:18,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:18,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:18,715 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:07:18,715 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [23] [2019-01-31 17:07:18,716 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:18,716 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:18,719 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:18,719 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:07:18,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:18,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:18,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:18,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:18,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:18,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:18,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:18,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:07:18,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:07:18,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:07:18,815 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:18,825 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:18,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:18,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:07:18,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:07:18,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:07:18,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:07:18,873 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,119 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,179 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,186 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:19,205 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:07:19,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:07:19,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:19,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:07:19,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,407 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:19,407 INFO L303 Elim1Store]: Index analysis took 142 ms [2019-01-31 17:07:19,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-31 17:07:19,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:19,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-31 17:07:19,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-31 17:07:19,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:19,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2019-01-31 17:07:19,523 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:19,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:19,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:19,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:19,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:07:19,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:19,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:19,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:19,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:19,565 INFO L87 Difference]: Start difference. First operand 50 states and 189 transitions. Second operand 10 states. [2019-01-31 17:07:19,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:19,960 INFO L93 Difference]: Finished difference Result 78 states and 242 transitions. [2019-01-31 17:07:19,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:07:19,961 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:07:19,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:19,962 INFO L225 Difference]: With dead ends: 78 [2019-01-31 17:07:19,962 INFO L226 Difference]: Without dead ends: 71 [2019-01-31 17:07:19,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:19,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-31 17:07:20,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2019-01-31 17:07:20,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-31 17:07:20,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 193 transitions. [2019-01-31 17:07:20,067 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 193 transitions. Word has length 7 [2019-01-31 17:07:20,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:20,067 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 193 transitions. [2019-01-31 17:07:20,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:20,067 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 193 transitions. [2019-01-31 17:07:20,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:07:20,067 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:20,067 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:20,068 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:20,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:20,068 INFO L82 PathProgramCache]: Analyzing trace with hash 2035260702, now seen corresponding path program 1 times [2019-01-31 17:07:20,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:20,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:20,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:20,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:20,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:20,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:07:20,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:20,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:20,224 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:07:20,224 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [24], [25] [2019-01-31 17:07:20,225 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:20,226 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:20,228 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:20,228 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:20,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:20,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:20,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:20,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:20,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:20,239 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:20,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:20,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:07:20,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:07:20,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:07:20,326 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,336 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:07:20,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:07:20,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:07:20,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:07:20,367 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,382 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,391 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,399 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:20,418 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:07:20,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:07:20,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:20,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:07:20,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-31 17:07:20,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:20,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-31 17:07:20,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:20,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:20,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:20,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:20,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:07:20,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:20,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:20,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:20,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:07:20,565 INFO L87 Difference]: Start difference. First operand 51 states and 193 transitions. Second operand 8 states. [2019-01-31 17:07:21,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:21,102 INFO L93 Difference]: Finished difference Result 64 states and 222 transitions. [2019-01-31 17:07:21,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:21,102 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-31 17:07:21,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:21,103 INFO L225 Difference]: With dead ends: 64 [2019-01-31 17:07:21,103 INFO L226 Difference]: Without dead ends: 56 [2019-01-31 17:07:21,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:21,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-31 17:07:21,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-01-31 17:07:21,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-31 17:07:21,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 187 transitions. [2019-01-31 17:07:21,207 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 187 transitions. Word has length 7 [2019-01-31 17:07:21,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:21,207 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 187 transitions. [2019-01-31 17:07:21,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:21,207 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 187 transitions. [2019-01-31 17:07:21,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:07:21,207 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:21,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:21,208 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:21,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:21,208 INFO L82 PathProgramCache]: Analyzing trace with hash 2042527720, now seen corresponding path program 2 times [2019-01-31 17:07:21,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:21,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:21,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:21,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:21,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:07:21,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:21,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:21,286 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:21,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:21,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:21,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:21,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:07:21,298 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:07:21,303 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:07:21,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:21,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:21,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-31 17:07:21,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-31 17:07:21,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-31 17:07:21,357 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,388 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:07:21,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-31 17:07:21,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-01-31 17:07:21,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-31 17:07:21,440 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,452 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,458 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,466 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:21,483 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-01-31 17:07:21,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-31 17:07:21,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:21,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-31 17:07:21,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:07:21,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:21,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-01-31 17:07:21,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,594 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:21,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 55 [2019-01-31 17:07:21,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:21,611 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-01-31 17:07:21,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:21,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:21,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:21,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:21,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:07:21,684 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:21,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:21,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:21,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:21,685 INFO L87 Difference]: Start difference. First operand 50 states and 187 transitions. Second operand 10 states. [2019-01-31 17:07:22,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:22,112 INFO L93 Difference]: Finished difference Result 76 states and 253 transitions. [2019-01-31 17:07:22,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:22,113 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:07:22,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:22,114 INFO L225 Difference]: With dead ends: 76 [2019-01-31 17:07:22,114 INFO L226 Difference]: Without dead ends: 67 [2019-01-31 17:07:22,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:07:22,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-31 17:07:22,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2019-01-31 17:07:22,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-31 17:07:22,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 191 transitions. [2019-01-31 17:07:22,236 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 191 transitions. Word has length 7 [2019-01-31 17:07:22,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:22,236 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 191 transitions. [2019-01-31 17:07:22,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:22,237 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 191 transitions. [2019-01-31 17:07:22,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:07:22,237 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:22,237 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:22,237 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:22,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:22,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2141495906, now seen corresponding path program 1 times [2019-01-31 17:07:22,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:22,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:22,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:22,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:22,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:22,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:07:22,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:22,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:22,355 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:07:22,355 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [22], [24], [25] [2019-01-31 17:07:22,356 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:22,356 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:22,359 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:22,359 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:22,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:22,360 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:22,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:22,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:22,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:22,371 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:22,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:22,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-01-31 17:07:22,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2019-01-31 17:07:22,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2019-01-31 17:07:22,403 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,409 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:07:22,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-31 17:07:22,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-01-31 17:07:22,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-31 17:07:22,439 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,450 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,458 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,466 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:22,479 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2019-01-31 17:07:22,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2019-01-31 17:07:22,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:07:22,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-31 17:07:22,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-01-31 17:07:22,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,573 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:22,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-31 17:07:22,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 48 [2019-01-31 17:07:22,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-31 17:07:22,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:32 [2019-01-31 17:07:22,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:22,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:22,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:22,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:22,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-01-31 17:07:22,692 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:22,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:22,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:22,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:07:22,693 INFO L87 Difference]: Start difference. First operand 51 states and 191 transitions. Second operand 10 states. [2019-01-31 17:07:23,192 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2019-01-31 17:07:23,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:23,737 INFO L93 Difference]: Finished difference Result 90 states and 306 transitions. [2019-01-31 17:07:23,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:07:23,737 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:07:23,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:23,738 INFO L225 Difference]: With dead ends: 90 [2019-01-31 17:07:23,738 INFO L226 Difference]: Without dead ends: 77 [2019-01-31 17:07:23,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:07:23,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-31 17:07:23,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2019-01-31 17:07:23,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-31 17:07:23,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 241 transitions. [2019-01-31 17:07:23,941 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 241 transitions. Word has length 7 [2019-01-31 17:07:23,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:23,942 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 241 transitions. [2019-01-31 17:07:23,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:23,942 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 241 transitions. [2019-01-31 17:07:23,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:07:23,942 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:23,942 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:23,942 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:23,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:23,943 INFO L82 PathProgramCache]: Analyzing trace with hash -314363692, now seen corresponding path program 1 times [2019-01-31 17:07:23,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:23,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:23,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:23,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:23,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:24,090 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:07:24,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:24,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:24,091 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:07:24,091 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [24], [25] [2019-01-31 17:07:24,093 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:24,093 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:24,096 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:24,096 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:24,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:24,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:24,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:24,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:24,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:24,108 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:24,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:24,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:07:24,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:07:24,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:07:24,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:07:24,150 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,164 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,174 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:07:24,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:07:24,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:07:24,263 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,273 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,284 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:24,303 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-31 17:07:24,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:07:24,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:24,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:07:24,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:07:24,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:24,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:07:24,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-01-31 17:07:24,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:24,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-31 17:07:24,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:24,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:24,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:24,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:24,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-31 17:07:24,509 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:24,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:07:24,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:07:24,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:24,509 INFO L87 Difference]: Start difference. First operand 63 states and 241 transitions. Second operand 11 states. [2019-01-31 17:07:25,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:25,173 INFO L93 Difference]: Finished difference Result 118 states and 409 transitions. [2019-01-31 17:07:25,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-31 17:07:25,173 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-31 17:07:25,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:25,174 INFO L225 Difference]: With dead ends: 118 [2019-01-31 17:07:25,175 INFO L226 Difference]: Without dead ends: 106 [2019-01-31 17:07:25,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:07:25,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-31 17:07:25,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 62. [2019-01-31 17:07:25,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-31 17:07:25,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 229 transitions. [2019-01-31 17:07:25,387 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 229 transitions. Word has length 8 [2019-01-31 17:07:25,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:25,388 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 229 transitions. [2019-01-31 17:07:25,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:07:25,388 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 229 transitions. [2019-01-31 17:07:25,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:07:25,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:25,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:25,388 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:25,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:25,389 INFO L82 PathProgramCache]: Analyzing trace with hash -307275420, now seen corresponding path program 1 times [2019-01-31 17:07:25,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:25,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:25,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:25,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:25,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:25,556 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-31 17:07:25,620 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:25,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:25,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:25,621 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:07:25,621 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [22], [23] [2019-01-31 17:07:25,626 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:25,626 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:25,628 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:25,628 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:07:25,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:25,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:25,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:25,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:25,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:25,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:25,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:25,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:07:25,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:07:25,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:07:25,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:07:25,683 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:25,700 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:25,709 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:25,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:25,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:07:25,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:07:25,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:07:25,834 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:25,852 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:25,864 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:25,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:25,885 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-31 17:07:25,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:07:25,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:25,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:25,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:07:25,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:07:25,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:26,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:07:26,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,071 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:26,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-31 17:07:26,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:26,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-31 17:07:26,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,288 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:26,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-31 17:07:26,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:26,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-01-31 17:07:26,373 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:26,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:26,417 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:26,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:26,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-31 17:07:26,437 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:26,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 17:07:26,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 17:07:26,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:07:26,438 INFO L87 Difference]: Start difference. First operand 62 states and 229 transitions. Second operand 13 states. [2019-01-31 17:07:27,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:27,265 INFO L93 Difference]: Finished difference Result 124 states and 443 transitions. [2019-01-31 17:07:27,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-31 17:07:27,266 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-01-31 17:07:27,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:27,267 INFO L225 Difference]: With dead ends: 124 [2019-01-31 17:07:27,267 INFO L226 Difference]: Without dead ends: 119 [2019-01-31 17:07:27,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=162, Invalid=300, Unknown=0, NotChecked=0, Total=462 [2019-01-31 17:07:27,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-31 17:07:27,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 73. [2019-01-31 17:07:27,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-31 17:07:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 277 transitions. [2019-01-31 17:07:27,547 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 277 transitions. Word has length 8 [2019-01-31 17:07:27,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:27,548 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 277 transitions. [2019-01-31 17:07:27,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 17:07:27,548 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 277 transitions. [2019-01-31 17:07:27,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:07:27,548 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:27,549 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:27,549 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:27,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:27,549 INFO L82 PathProgramCache]: Analyzing trace with hash -592077742, now seen corresponding path program 1 times [2019-01-31 17:07:27,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:27,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:27,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:27,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:27,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:27,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 17:07:27,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:27,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:27,627 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:07:27,627 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [22], [24], [25] [2019-01-31 17:07:27,628 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:27,628 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:27,631 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:27,631 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:27,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:27,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:27,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:27,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:27,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:27,645 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:27,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:27,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:07:27,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-31 17:07:27,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-01-31 17:07:27,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-31 17:07:27,675 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,686 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,694 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-01-31 17:07:27,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2019-01-31 17:07:27,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2019-01-31 17:07:27,734 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,741 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,747 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:27,766 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2019-01-31 17:07:27,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2019-01-31 17:07:27,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:07:27,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-31 17:07:27,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2019-01-31 17:07:27,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:07:27,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2019-01-31 17:07:27,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-31 17:07:27,906 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:32 [2019-01-31 17:07:27,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:07:27,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 48 [2019-01-31 17:07:27,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-31 17:07:27,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:28 [2019-01-31 17:07:28,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:28,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:28,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:28,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:28,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-31 17:07:28,062 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:28,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:07:28,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:07:28,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:28,062 INFO L87 Difference]: Start difference. First operand 73 states and 277 transitions. Second operand 9 states. [2019-01-31 17:07:28,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:28,771 INFO L93 Difference]: Finished difference Result 87 states and 314 transitions. [2019-01-31 17:07:28,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:28,772 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-31 17:07:28,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:28,773 INFO L225 Difference]: With dead ends: 87 [2019-01-31 17:07:28,773 INFO L226 Difference]: Without dead ends: 80 [2019-01-31 17:07:28,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:07:28,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-31 17:07:29,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-01-31 17:07:29,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-31 17:07:29,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 297 transitions. [2019-01-31 17:07:29,091 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 297 transitions. Word has length 8 [2019-01-31 17:07:29,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:29,092 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 297 transitions. [2019-01-31 17:07:29,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:07:29,092 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 297 transitions. [2019-01-31 17:07:29,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:07:29,093 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:29,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:29,093 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:29,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:29,093 INFO L82 PathProgramCache]: Analyzing trace with hash -477682288, now seen corresponding path program 2 times [2019-01-31 17:07:29,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:29,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:29,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:29,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:29,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:29,300 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:07:29,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:29,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:29,300 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:29,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:29,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:29,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:29,309 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:07:29,309 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:07:29,315 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:07:29,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:29,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:29,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:07:29,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-31 17:07:29,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-01-31 17:07:29,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-31 17:07:29,335 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,350 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,357 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-31 17:07:29,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-31 17:07:29,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-31 17:07:29,419 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,427 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,435 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,451 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:41, output treesize:41 [2019-01-31 17:07:29,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:07:29,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:07:29,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-31 17:07:29,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:58 [2019-01-31 17:07:29,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-31 17:07:29,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,693 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:29,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2019-01-31 17:07:29,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-31 17:07:29,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:74, output treesize:54 [2019-01-31 17:07:29,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,768 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:29,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 77 [2019-01-31 17:07:29,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-01-31 17:07:29,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-31 17:07:29,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:48 [2019-01-31 17:07:29,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2019-01-31 17:07:29,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,917 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:29,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2019-01-31 17:07:29,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:07:29,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:68, output treesize:48 [2019-01-31 17:07:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:29,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:30,036 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:30,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:30,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-31 17:07:30,056 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:30,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 17:07:30,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 17:07:30,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:07:30,056 INFO L87 Difference]: Start difference. First operand 78 states and 297 transitions. Second operand 13 states. [2019-01-31 17:07:31,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:31,300 INFO L93 Difference]: Finished difference Result 186 states and 694 transitions. [2019-01-31 17:07:31,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:07:31,300 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-01-31 17:07:31,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:31,301 INFO L225 Difference]: With dead ends: 186 [2019-01-31 17:07:31,301 INFO L226 Difference]: Without dead ends: 177 [2019-01-31 17:07:31,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2019-01-31 17:07:31,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-31 17:07:31,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 95. [2019-01-31 17:07:31,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-31 17:07:31,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 371 transitions. [2019-01-31 17:07:31,711 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 371 transitions. Word has length 8 [2019-01-31 17:07:31,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:31,711 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 371 transitions. [2019-01-31 17:07:31,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 17:07:31,711 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 371 transitions. [2019-01-31 17:07:31,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:07:31,712 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:31,712 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:31,712 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:31,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:31,712 INFO L82 PathProgramCache]: Analyzing trace with hash -931909288, now seen corresponding path program 1 times [2019-01-31 17:07:31,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:31,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:31,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:31,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:31,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 17:07:31,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:31,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:31,892 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:07:31,892 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [24], [25] [2019-01-31 17:07:31,893 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:31,893 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:31,897 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:31,897 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:07:31,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:31,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:31,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:31,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:31,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:31,912 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:31,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:31,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:07:31,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:07:31,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:07:31,992 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:32,002 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:32,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:32,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:07:32,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:07:32,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:07:32,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:07:32,033 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:32,047 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:32,056 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:32,063 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:32,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:32,081 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:07:32,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:07:32,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:32,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:32,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:07:32,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:07:32,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:32,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:32,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:07:32,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,191 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:32,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-31 17:07:32,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:32,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:32,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-31 17:07:32,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 89 [2019-01-31 17:07:32,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:32,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:32,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-31 17:07:32,293 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:32,293 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:32,335 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:32,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:32,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:07:32,353 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:32,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:07:32,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:07:32,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:32,354 INFO L87 Difference]: Start difference. First operand 95 states and 371 transitions. Second operand 12 states. [2019-01-31 17:07:33,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:33,103 INFO L93 Difference]: Finished difference Result 110 states and 418 transitions. [2019-01-31 17:07:33,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:07:33,108 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-31 17:07:33,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:33,109 INFO L225 Difference]: With dead ends: 110 [2019-01-31 17:07:33,109 INFO L226 Difference]: Without dead ends: 80 [2019-01-31 17:07:33,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:07:33,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-31 17:07:33,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 26. [2019-01-31 17:07:33,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-31 17:07:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-01-31 17:07:33,219 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 9 [2019-01-31 17:07:33,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:33,219 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-01-31 17:07:33,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:07:33,219 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-01-31 17:07:33,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:07:33,220 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:33,220 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:33,220 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:33,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:33,220 INFO L82 PathProgramCache]: Analyzing trace with hash -898856470, now seen corresponding path program 3 times [2019-01-31 17:07:33,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:33,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:33,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:33,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:33,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:33,404 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-31 17:07:33,672 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-31 17:07:33,726 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-31 17:07:33,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:33,726 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:33,726 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:33,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:33,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:33,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:33,736 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:07:33,736 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:07:33,740 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:07:33,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:33,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:33,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:07:33,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:07:33,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:07:33,824 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:33,834 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:33,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:33,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:07:33,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:07:33,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:07:33,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:07:33,864 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:33,877 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:33,886 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:33,893 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:33,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:33,911 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-31 17:07:33,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:07:33,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:33,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:33,958 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:07:33,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-31 17:07:33,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:34,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:25 [2019-01-31 17:07:34,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,035 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:34,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-31 17:07:34,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:34,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:27 [2019-01-31 17:07:34,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,082 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:34,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-31 17:07:34,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:34,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:29 [2019-01-31 17:07:34,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 59 [2019-01-31 17:07:34,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:34,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2019-01-31 17:07:34,179 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:34,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:34,256 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:34,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:34,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-31 17:07:34,276 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:34,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 17:07:34,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 17:07:34,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:07:34,276 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 13 states. [2019-01-31 17:07:34,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:34,746 INFO L93 Difference]: Finished difference Result 32 states and 109 transitions. [2019-01-31 17:07:34,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:07:34,747 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-31 17:07:34,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:34,748 INFO L225 Difference]: With dead ends: 32 [2019-01-31 17:07:34,748 INFO L226 Difference]: Without dead ends: 0 [2019-01-31 17:07:34,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-01-31 17:07:34,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-31 17:07:34,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-31 17:07:34,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-31 17:07:34,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-31 17:07:34,749 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2019-01-31 17:07:34,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:34,750 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-31 17:07:34,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 17:07:34,750 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 17:07:34,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 17:07:34,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-31 17:07:35,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:35,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:35,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:35,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:35,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:35,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:35,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:35,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:35,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:35,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:35,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:36,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:36,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:36,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:36,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:36,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:36,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:36,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:36,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:36,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:36,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:38,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:39,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:39,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:43,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:46,064 WARN L181 SmtUtils]: Spent 11.30 s on a formula simplification. DAG size of input: 1504 DAG size of output: 1059 [2019-01-31 17:08:02,183 WARN L181 SmtUtils]: Spent 16.11 s on a formula simplification. DAG size of input: 996 DAG size of output: 75 [2019-01-31 17:08:02,186 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-31 17:08:02,186 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2019-01-31 17:08:02,186 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 40) no Hoare annotation was computed. [2019-01-31 17:08:02,186 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 41) no Hoare annotation was computed. [2019-01-31 17:08:02,186 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-01-31 17:08:02,187 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-31 17:08:02,187 INFO L444 ceAbstractionStarter]: At program point L32-1(lines 27 37) the Hoare annotation is: (let ((.cse3 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse16 (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse3 1)))) (let ((.cse1 (select |#memory_int| ULTIMATE.start_main_p4)) (.cse15 (select .cse16 ULTIMATE.start_main_p1)) (.cse2 (select |#memory_int| ULTIMATE.start_main_p2)) (.cse6 (select |#memory_int| ULTIMATE.start_main_p1))) (let ((.cse11 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse6 1))) (.cse10 (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse2 (- 1)))) (.cse0 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4))) (.cse17 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (.cse4 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4))) (.cse9 (= 0 .cse15)) (.cse5 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4))) (.cse18 (= 0 (select .cse16 ULTIMATE.start_main_p2))) (.cse7 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse1 (- 1))))) (let ((.cse13 (and .cse0 .cse17 .cse4 .cse9 .cse5 .cse18 (<= 1 (select .cse7 ULTIMATE.start_main_p3)))) (.cse12 (select .cse10 ULTIMATE.start_main_p3)) (.cse14 (<= (+ (select .cse11 ULTIMATE.start_main_p4) 1) 0))) (or (and .cse0 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= .cse1 0) (<= .cse2 0) (= .cse3 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)) .cse4 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) .cse5 (<= 0 .cse6)) (and .cse4 (let ((.cse8 (<= (+ (select .cse11 ULTIMATE.start_main_p2) 1) 0))) (or (and (= 0 (select .cse7 ULTIMATE.start_main_p2)) (<= 1 (select .cse7 ULTIMATE.start_main_p1))) (and .cse8 (and .cse9 .cse0)) (and (<= 1 (select .cse10 ULTIMATE.start_main_p1)) .cse8))) (<= .cse1 0) (<= 0 .cse12)) (and .cse13 .cse14) (and .cse13 (= .cse15 (select .cse16 ULTIMATE.start_main_p4))) (and (and .cse17 .cse9 (= 0 .cse12) .cse18) .cse14))))))) [2019-01-31 17:08:02,187 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-31 17:08:02,187 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 44) no Hoare annotation was computed. [2019-01-31 17:08:02,187 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 42) no Hoare annotation was computed. [2019-01-31 17:08:02,187 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-01-31 17:08:02,204 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 05:08:02 BoogieIcfgContainer [2019-01-31 17:08:02,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-31 17:08:02,205 INFO L168 Benchmark]: Toolchain (without parser) took 93787.45 ms. Allocated memory was 141.6 MB in the beginning and 904.9 MB in the end (delta: 763.4 MB). Free memory was 109.1 MB in the beginning and 643.5 MB in the end (delta: -534.4 MB). Peak memory consumption was 834.0 MB. Max. memory is 7.1 GB. [2019-01-31 17:08:02,206 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 141.6 MB. Free memory is still 110.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 17:08:02,206 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.76 ms. Allocated memory is still 141.6 MB. Free memory was 108.9 MB in the beginning and 106.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-01-31 17:08:02,206 INFO L168 Benchmark]: Boogie Preprocessor took 22.87 ms. Allocated memory is still 141.6 MB. Free memory was 106.8 MB in the beginning and 105.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-31 17:08:02,206 INFO L168 Benchmark]: RCFGBuilder took 331.60 ms. Allocated memory is still 141.6 MB. Free memory was 105.5 MB in the beginning and 95.2 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-01-31 17:08:02,206 INFO L168 Benchmark]: TraceAbstraction took 93376.26 ms. Allocated memory was 141.6 MB in the beginning and 904.9 MB in the end (delta: 763.4 MB). Free memory was 94.8 MB in the beginning and 643.5 MB in the end (delta: -548.8 MB). Peak memory consumption was 819.6 MB. Max. memory is 7.1 GB. [2019-01-31 17:08:02,208 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.16 ms. Allocated memory is still 141.6 MB. Free memory is still 110.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 52.76 ms. Allocated memory is still 141.6 MB. Free memory was 108.9 MB in the beginning and 106.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.87 ms. Allocated memory is still 141.6 MB. Free memory was 106.8 MB in the beginning and 105.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 331.60 ms. Allocated memory is still 141.6 MB. Free memory was 105.5 MB in the beginning and 95.2 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 93376.26 ms. Allocated memory was 141.6 MB in the beginning and 904.9 MB in the end (delta: 763.4 MB). Free memory was 94.8 MB in the beginning and 643.5 MB in the end (delta: -548.8 MB). Peak memory consumption was 819.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 39]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 40]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 42]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((((((((((!(p1 == p4) && !(p2 == p1)) && #memory_int[p4] == 0) && #memory_int[p2] <= 0) && #memory_int[p3] == 0) && !(p1 == p3)) && !(p3 == p4)) && !(p3 == p2)) && !(p2 == p4)) && 0 <= #memory_int[p1]) || (((!(p3 == p4) && (((0 == #memory_int[p4 := #memory_int[p4] + -1][p2] && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) || (#memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0 && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1] && !(p1 == p4))) || (1 <= #memory_int[p2 := #memory_int[p2] + -1][p1] && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0))) && #memory_int[p4] <= 0) && 0 <= #memory_int[p2 := #memory_int[p2] + -1][p3])) || (((((((!(p1 == p4) && !(p1 == p2)) && !(p3 == p4)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1]) && !(p2 == p4)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0)) || (((((((!(p1 == p4) && !(p1 == p2)) && !(p3 == p4)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1]) && !(p2 == p4)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && #memory_int[p3 := #memory_int[p3] + 1][p1] == #memory_int[p3 := #memory_int[p3] + 1][p4])) || ((((!(p1 == p2) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1]) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p3]) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 4 error locations. SAFE Result, 93.2s OverallTime, 55 OverallIterations, 3 TraceHistogramMax, 24.1s AutomataDifference, 0.0s DeadEndRemovalTime, 27.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 198 SDtfs, 956 SDslu, 1 SDs, 0 SdLazy, 9084 SolverSat, 820 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 838 GetRequests, 140 SyntacticMatches, 32 SemanticMatches, 666 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2560 ImplicationChecksByTransitivity, 19.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 36 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 55 MinimizatonAttempts, 1314 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 46 NumberOfFragments, 352 HoareAnnotationTreeSize, 1 FomulaSimplifications, 4079744448 FormulaSimplificationTreeSizeReduction, 11.3s HoareSimplificationTime, 1 FomulaSimplificationsInter, 39947544 FormulaSimplificationTreeSizeReductionInter, 16.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 35.2s InterpolantComputationTime, 609 NumberOfCodeBlocks, 609 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 748 ConstructedInterpolants, 222 QuantifiedInterpolants, 91459 SizeOfPredicates, 243 NumberOfNonLiveVariables, 1010 ConjunctsInSsa, 643 ConjunctsInUnsatCore, 157 InterpolantComputations, 7 PerfectInterpolantSequences, 155/871 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...