java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-e1a14da [2018-12-24 14:28:08,359 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-24 14:28:08,361 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-24 14:28:08,373 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-24 14:28:08,374 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-24 14:28:08,375 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-24 14:28:08,376 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-24 14:28:08,378 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-24 14:28:08,379 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-24 14:28:08,380 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-24 14:28:08,381 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-24 14:28:08,382 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-24 14:28:08,382 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-24 14:28:08,383 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-24 14:28:08,384 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-24 14:28:08,385 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-24 14:28:08,386 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-24 14:28:08,388 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-24 14:28:08,390 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-24 14:28:08,392 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-24 14:28:08,393 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-24 14:28:08,394 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-24 14:28:08,397 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-24 14:28:08,397 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-24 14:28:08,397 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-24 14:28:08,398 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-24 14:28:08,399 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-24 14:28:08,400 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-24 14:28:08,401 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-24 14:28:08,402 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-24 14:28:08,403 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-24 14:28:08,403 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-24 14:28:08,404 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-24 14:28:08,404 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-24 14:28:08,405 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-24 14:28:08,406 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-24 14:28:08,406 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-24 14:28:08,421 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-24 14:28:08,421 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-24 14:28:08,422 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-24 14:28:08,422 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-24 14:28:08,422 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-24 14:28:08,423 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-24 14:28:08,423 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-24 14:28:08,423 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-24 14:28:08,423 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-24 14:28:08,423 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-24 14:28:08,424 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-24 14:28:08,424 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-24 14:28:08,424 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-24 14:28:08,425 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-24 14:28:08,425 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-24 14:28:08,425 INFO L133 SettingsManager]: * Use SBE=true [2018-12-24 14:28:08,425 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-24 14:28:08,426 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-24 14:28:08,426 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-24 14:28:08,426 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-24 14:28:08,426 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-24 14:28:08,426 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-24 14:28:08,427 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-24 14:28:08,427 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-24 14:28:08,427 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-24 14:28:08,427 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-24 14:28:08,427 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-24 14:28:08,428 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-24 14:28:08,428 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-24 14:28:08,428 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-24 14:28:08,428 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 14:28:08,428 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-24 14:28:08,429 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-24 14:28:08,429 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-24 14:28:08,429 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-24 14:28:08,429 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-24 14:28:08,429 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-24 14:28:08,430 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-24 14:28:08,430 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-24 14:28:08,461 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-24 14:28:08,474 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-24 14:28:08,483 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-24 14:28:08,485 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-24 14:28:08,485 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-24 14:28:08,486 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 [2018-12-24 14:28:08,487 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl' [2018-12-24 14:28:08,525 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-24 14:28:08,526 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-24 14:28:08,527 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-24 14:28:08,527 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-24 14:28:08,528 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-24 14:28:08,545 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 24.12 02:28:08" (1/1) ... [2018-12-24 14:28:08,559 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 24.12 02:28:08" (1/1) ... [2018-12-24 14:28:08,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-24 14:28:08,587 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-24 14:28:08,587 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-24 14:28:08,587 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-24 14:28:08,599 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 24.12 02:28:08" (1/1) ... [2018-12-24 14:28:08,599 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 24.12 02:28:08" (1/1) ... [2018-12-24 14:28:08,601 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 24.12 02:28:08" (1/1) ... [2018-12-24 14:28:08,601 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 24.12 02:28:08" (1/1) ... [2018-12-24 14:28:08,604 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 24.12 02:28:08" (1/1) ... [2018-12-24 14:28:08,608 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 24.12 02:28:08" (1/1) ... [2018-12-24 14:28:08,609 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 24.12 02:28:08" (1/1) ... [2018-12-24 14:28:08,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-24 14:28:08,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-24 14:28:08,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-24 14:28:08,612 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-24 14:28:08,613 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 24.12 02:28:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 14:28:08,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-24 14:28:08,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-24 14:28:09,016 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-24 14:28:09,016 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-12-24 14:28:09,017 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:28:09 BoogieIcfgContainer [2018-12-24 14:28:09,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-24 14:28:09,018 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-24 14:28:09,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-24 14:28:09,022 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-24 14:28:09,022 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 24.12 02:28:08" (1/2) ... [2018-12-24 14:28:09,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eaf544b and model type speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 02:28:09, skipping insertion in model container [2018-12-24 14:28:09,024 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 24.12 02:28:09" (2/2) ... [2018-12-24 14:28:09,026 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-unlimited.bpl [2018-12-24 14:28:09,037 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-24 14:28:09,045 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-12-24 14:28:09,065 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-12-24 14:28:09,105 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-24 14:28:09,105 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-24 14:28:09,106 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-24 14:28:09,106 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-24 14:28:09,106 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-24 14:28:09,106 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-24 14:28:09,106 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-24 14:28:09,107 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-24 14:28:09,123 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2018-12-24 14:28:09,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-24 14:28:09,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:09,131 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-24 14:28:09,134 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:09,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:09,140 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2018-12-24 14:28:09,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:09,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:09,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:09,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:09,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:09,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:09,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 14:28:09,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-24 14:28:09,367 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 14:28:09,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 14:28:09,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 14:28:09,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 14:28:09,398 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2018-12-24 14:28:09,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:09,619 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2018-12-24 14:28:09,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 14:28:09,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-24 14:28:09,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:09,633 INFO L225 Difference]: With dead ends: 21 [2018-12-24 14:28:09,633 INFO L226 Difference]: Without dead ends: 16 [2018-12-24 14:28:09,637 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 [2018-12-24 14:28:09,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-24 14:28:09,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2018-12-24 14:28:09,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-24 14:28:09,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2018-12-24 14:28:09,668 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2018-12-24 14:28:09,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:09,669 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2018-12-24 14:28:09,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 14:28:09,670 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2018-12-24 14:28:09,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 14:28:09,670 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:09,670 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 14:28:09,671 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:09,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:09,671 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2018-12-24 14:28:09,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:09,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:09,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:09,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:09,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:09,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:09,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:09,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:09,751 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-24 14:28:09,753 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2018-12-24 14:28:09,806 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:28:09,806 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:28:14,258 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:28:14,260 INFO L272 AbstractInterpreter]: Visited 3 different actions 11 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 14:28:14,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:14,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:28:14,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:14,269 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 [2018-12-24 14:28:14,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:14,286 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:28:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:14,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:14,488 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-12-24 14:28:14,510 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 [2018-12-24 14:28:14,516 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 [2018-12-24 14:28:14,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:14,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:14,547 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 [2018-12-24 14:28:14,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:14,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:14,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:14,582 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 [2018-12-24 14:28:14,586 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:14,695 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:14,836 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:14,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:15,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:15,016 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 [2018-12-24 14:28:15,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:15,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:15,097 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 [2018-12-24 14:28:15,284 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2018-12-24 14:28:15,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:15,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:15,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:15,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:15,295 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 [2018-12-24 14:28:15,297 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:15,345 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:15,356 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:15,391 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. [2018-12-24 14:28:15,392 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2018-12-24 14:28:15,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:15,511 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 [2018-12-24 14:28:15,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:15,765 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. [2018-12-24 14:28:15,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2018-12-24 14:28:15,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:15,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:16,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:16,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:16,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 14:28:16,211 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:16,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 14:28:16,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 14:28:16,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 14:28:16,213 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2018-12-24 14:28:16,545 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-24 14:28:16,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:16,892 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2018-12-24 14:28:16,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 14:28:16,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2018-12-24 14:28:16,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:16,895 INFO L225 Difference]: With dead ends: 31 [2018-12-24 14:28:16,895 INFO L226 Difference]: Without dead ends: 28 [2018-12-24 14:28:16,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-12-24 14:28:16,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-24 14:28:16,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 13. [2018-12-24 14:28:16,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-24 14:28:16,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2018-12-24 14:28:16,902 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2018-12-24 14:28:16,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:16,902 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2018-12-24 14:28:16,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 14:28:16,902 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2018-12-24 14:28:16,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 14:28:16,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:16,903 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 14:28:16,903 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:16,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:16,904 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2018-12-24 14:28:16,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:16,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:16,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:16,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:16,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:16,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:16,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 14:28:16,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-24 14:28:16,953 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 14:28:16,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 14:28:16,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 14:28:16,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 14:28:16,954 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2018-12-24 14:28:17,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:17,002 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2018-12-24 14:28:17,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 14:28:17,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-24 14:28:17,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:17,003 INFO L225 Difference]: With dead ends: 15 [2018-12-24 14:28:17,003 INFO L226 Difference]: Without dead ends: 14 [2018-12-24 14:28:17,004 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 [2018-12-24 14:28:17,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-24 14:28:17,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-12-24 14:28:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-24 14:28:17,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2018-12-24 14:28:17,009 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2018-12-24 14:28:17,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:17,009 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2018-12-24 14:28:17,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 14:28:17,009 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2018-12-24 14:28:17,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 14:28:17,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:17,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 14:28:17,010 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:17,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:17,010 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2018-12-24 14:28:17,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:17,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:17,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:17,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:17,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:17,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:17,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:17,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:17,076 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-24 14:28:17,076 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2018-12-24 14:28:17,080 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:28:17,080 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:28:17,358 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:28:17,358 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 14:28:17,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:17,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:28:17,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:17,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:28:17,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:17,375 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:28:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:17,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:17,529 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-24 14:28:17,546 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 [2018-12-24 14:28:17,565 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 [2018-12-24 14:28:17,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:17,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:17,634 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 [2018-12-24 14:28:17,648 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 [2018-12-24 14:28:17,649 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:17,725 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:17,742 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:17,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:17,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:17,805 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 [2018-12-24 14:28:17,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:17,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:17,904 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 [2018-12-24 14:28:17,904 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:17,909 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:17,926 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. [2018-12-24 14:28:17,926 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:35, output treesize:33 [2018-12-24 14:28:17,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:17,965 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 [2018-12-24 14:28:17,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:17,976 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. [2018-12-24 14:28:17,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2018-12-24 14:28:17,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:17,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:18,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:18,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-24 14:28:18,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2018-12-24 14:28:18,026 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 14:28:18,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 14:28:18,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 14:28:18,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 14:28:18,027 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 4 states. [2018-12-24 14:28:18,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:18,113 INFO L93 Difference]: Finished difference Result 18 states and 41 transitions. [2018-12-24 14:28:18,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-24 14:28:18,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-24 14:28:18,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:18,114 INFO L225 Difference]: With dead ends: 18 [2018-12-24 14:28:18,114 INFO L226 Difference]: Without dead ends: 17 [2018-12-24 14:28:18,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 14:28:18,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-24 14:28:18,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-12-24 14:28:18,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-24 14:28:18,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2018-12-24 14:28:18,122 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3 [2018-12-24 14:28:18,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:18,122 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2018-12-24 14:28:18,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 14:28:18,122 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2018-12-24 14:28:18,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 14:28:18,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:18,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 14:28:18,123 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:18,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:18,124 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2018-12-24 14:28:18,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:18,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:18,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:18,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:18,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:18,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:18,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:18,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:18,202 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-24 14:28:18,202 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2018-12-24 14:28:18,206 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:28:18,206 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:28:18,509 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:28:18,510 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 14:28:18,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:18,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:28:18,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:18,511 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 [2018-12-24 14:28:18,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:18,527 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:28:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:18,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:18,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:18,607 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 [2018-12-24 14:28:18,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:18,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:18,663 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 [2018-12-24 14:28:18,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:18,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:18,690 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 [2018-12-24 14:28:18,693 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 [2018-12-24 14:28:18,699 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 [2018-12-24 14:28:18,707 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 [2018-12-24 14:28:18,708 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:18,759 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:18,770 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:18,783 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:18,798 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. [2018-12-24 14:28:18,798 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2018-12-24 14:28:18,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:18,840 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 [2018-12-24 14:28:18,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:18,858 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. [2018-12-24 14:28:18,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2018-12-24 14:28:18,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:18,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:18,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:18,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:18,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 14:28:18,911 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:18,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 14:28:18,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 14:28:18,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 14:28:18,912 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 6 states. [2018-12-24 14:28:19,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:19,050 INFO L93 Difference]: Finished difference Result 32 states and 62 transitions. [2018-12-24 14:28:19,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 14:28:19,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2018-12-24 14:28:19,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:19,052 INFO L225 Difference]: With dead ends: 32 [2018-12-24 14:28:19,052 INFO L226 Difference]: Without dead ends: 31 [2018-12-24 14:28:19,054 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 [2018-12-24 14:28:19,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-24 14:28:19,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2018-12-24 14:28:19,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-24 14:28:19,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2018-12-24 14:28:19,061 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 50 transitions. Word has length 3 [2018-12-24 14:28:19,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:19,061 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 50 transitions. [2018-12-24 14:28:19,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 14:28:19,061 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 50 transitions. [2018-12-24 14:28:19,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 14:28:19,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:19,062 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 14:28:19,062 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:19,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:19,063 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2018-12-24 14:28:19,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:19,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:19,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:19,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:19,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:19,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:19,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:19,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:19,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:19,164 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 14:28:19,164 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2018-12-24 14:28:19,167 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:28:19,167 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:28:21,526 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:28:21,526 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 14:28:21,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:21,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:28:21,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:21,527 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 [2018-12-24 14:28:21,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:21,540 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:28:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:21,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:21,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:21,630 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 [2018-12-24 14:28:21,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:21,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:21,660 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 [2018-12-24 14:28:21,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:21,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:21,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:21,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:21,699 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 [2018-12-24 14:28:21,700 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:21,711 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:21,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:21,741 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 [2018-12-24 14:28:21,744 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 [2018-12-24 14:28:21,753 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 [2018-12-24 14:28:21,757 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 [2018-12-24 14:28:21,758 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:21,807 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:21,825 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:21,833 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:21,856 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. [2018-12-24 14:28:21,857 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2018-12-24 14:28:21,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:21,888 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 [2018-12-24 14:28:21,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:21,906 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. [2018-12-24 14:28:21,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2018-12-24 14:28:21,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:21,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:21,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:21,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-24 14:28:21,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2018-12-24 14:28:21,966 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 14:28:21,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 14:28:21,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 14:28:21,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-24 14:28:21,967 INFO L87 Difference]: Start difference. First operand 18 states and 50 transitions. Second operand 4 states. [2018-12-24 14:28:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:22,049 INFO L93 Difference]: Finished difference Result 22 states and 58 transitions. [2018-12-24 14:28:22,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 14:28:22,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-24 14:28:22,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:22,050 INFO L225 Difference]: With dead ends: 22 [2018-12-24 14:28:22,050 INFO L226 Difference]: Without dead ends: 21 [2018-12-24 14:28:22,051 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 [2018-12-24 14:28:22,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-24 14:28:22,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-12-24 14:28:22,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-24 14:28:22,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2018-12-24 14:28:22,056 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2018-12-24 14:28:22,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:22,056 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2018-12-24 14:28:22,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 14:28:22,057 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2018-12-24 14:28:22,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 14:28:22,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:22,057 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 14:28:22,058 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:22,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:22,058 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2018-12-24 14:28:22,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:22,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:22,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:22,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:22,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:22,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:22,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:22,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:22,116 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 14:28:22,117 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2018-12-24 14:28:22,119 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:28:22,119 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:28:23,090 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:28:23,090 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 14:28:23,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:23,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:28:23,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:23,091 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 [2018-12-24 14:28:23,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:23,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:28:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:23,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:23,138 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 [2018-12-24 14:28:23,143 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 [2018-12-24 14:28:23,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:23,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:23,151 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 [2018-12-24 14:28:23,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:23,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:23,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:23,164 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 [2018-12-24 14:28:23,164 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:23,191 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:23,206 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:23,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:23,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:23,236 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 [2018-12-24 14:28:23,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:23,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:23,265 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 [2018-12-24 14:28:23,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:23,297 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:23,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:23,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:23,300 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 [2018-12-24 14:28:23,301 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:23,311 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:23,319 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:23,338 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. [2018-12-24 14:28:23,338 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 14:28:23,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:23,366 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 [2018-12-24 14:28:23,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:23,386 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. [2018-12-24 14:28:23,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 14:28:23,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:23,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:23,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:23,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:23,412 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:28:23,413 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 [2018-12-24 14:28:23,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:23,437 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. [2018-12-24 14:28:23,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2018-12-24 14:28:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:23,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:23,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:23,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:23,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 14:28:23,501 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:23,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 14:28:23,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 14:28:23,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-24 14:28:23,502 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 8 states. [2018-12-24 14:28:23,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:23,923 INFO L93 Difference]: Finished difference Result 37 states and 74 transitions. [2018-12-24 14:28:23,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 14:28:23,923 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-24 14:28:23,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:23,924 INFO L225 Difference]: With dead ends: 37 [2018-12-24 14:28:23,925 INFO L226 Difference]: Without dead ends: 36 [2018-12-24 14:28:23,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-12-24 14:28:23,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-24 14:28:23,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. [2018-12-24 14:28:23,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-24 14:28:23,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2018-12-24 14:28:23,931 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 4 [2018-12-24 14:28:23,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:23,931 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2018-12-24 14:28:23,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 14:28:23,931 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2018-12-24 14:28:23,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 14:28:23,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:23,932 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 14:28:23,932 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:23,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:23,933 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2018-12-24 14:28:23,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:23,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:23,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:23,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:23,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:24,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:24,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:24,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:24,100 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 14:28:24,100 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2018-12-24 14:28:24,101 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:28:24,101 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:28:24,782 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:28:24,782 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 14:28:24,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:24,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:28:24,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:24,783 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 [2018-12-24 14:28:24,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:24,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:28:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:24,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:24,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:24,826 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 [2018-12-24 14:28:24,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:24,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:24,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 [2018-12-24 14:28:24,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:24,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:24,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:24,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:24,929 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 [2018-12-24 14:28:24,930 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:24,940 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:24,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:24,965 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 [2018-12-24 14:28:24,969 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 [2018-12-24 14:28:24,971 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 [2018-12-24 14:28:24,974 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 [2018-12-24 14:28:24,975 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:24,991 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:25,001 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:25,009 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:25,040 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. [2018-12-24 14:28:25,041 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 14:28:25,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:25,068 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 [2018-12-24 14:28:25,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:25,107 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. [2018-12-24 14:28:25,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 14:28:25,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:25,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:25,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:25,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:25,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:25,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:25,138 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 [2018-12-24 14:28:25,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:25,181 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. [2018-12-24 14:28:25,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-12-24 14:28:25,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:25,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:25,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:25,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:25,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 14:28:25,273 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:25,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 14:28:25,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 14:28:25,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-24 14:28:25,274 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 8 states. [2018-12-24 14:28:25,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:25,626 INFO L93 Difference]: Finished difference Result 46 states and 87 transitions. [2018-12-24 14:28:25,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 14:28:25,627 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-24 14:28:25,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:25,628 INFO L225 Difference]: With dead ends: 46 [2018-12-24 14:28:25,628 INFO L226 Difference]: Without dead ends: 40 [2018-12-24 14:28:25,628 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 [2018-12-24 14:28:25,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-24 14:28:25,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2018-12-24 14:28:25,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-24 14:28:25,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2018-12-24 14:28:25,635 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 58 transitions. Word has length 4 [2018-12-24 14:28:25,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:25,636 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 58 transitions. [2018-12-24 14:28:25,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 14:28:25,636 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 58 transitions. [2018-12-24 14:28:25,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 14:28:25,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:25,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 14:28:25,637 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:25,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:25,637 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 1 times [2018-12-24 14:28:25,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:25,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:25,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:25,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:25,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:25,913 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2018-12-24 14:28:25,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:25,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:25,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:25,924 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 14:28:25,924 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2018-12-24 14:28:25,927 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:28:25,927 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:28:26,550 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:28:26,551 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 14:28:26,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:26,551 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:28:26,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:26,551 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 [2018-12-24 14:28:26,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:26,560 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:28:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:26,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:26,588 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 [2018-12-24 14:28:26,596 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 [2018-12-24 14:28:26,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:26,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:26,604 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 [2018-12-24 14:28:26,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:26,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:26,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:26,650 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 [2018-12-24 14:28:26,652 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:26,677 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:26,688 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:26,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:26,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:26,724 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 [2018-12-24 14:28:26,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:26,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:26,754 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 [2018-12-24 14:28:26,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:26,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:26,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:26,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:26,791 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 [2018-12-24 14:28:26,792 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:26,803 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:26,812 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:26,833 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. [2018-12-24 14:28:26,834 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2018-12-24 14:28:26,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:26,872 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 [2018-12-24 14:28:26,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:26,894 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. [2018-12-24 14:28:26,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 14:28:26,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:26,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:26,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:26,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:26,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:26,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:26,921 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 [2018-12-24 14:28:26,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:26,946 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. [2018-12-24 14:28:26,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2018-12-24 14:28:26,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:26,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:26,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:26,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:26,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2018-12-24 14:28:26,999 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:27,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 14:28:27,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 14:28:27,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-12-24 14:28:27,001 INFO L87 Difference]: Start difference. First operand 22 states and 58 transitions. Second operand 8 states. [2018-12-24 14:28:27,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:27,202 INFO L93 Difference]: Finished difference Result 52 states and 124 transitions. [2018-12-24 14:28:27,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 14:28:27,202 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-24 14:28:27,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:27,204 INFO L225 Difference]: With dead ends: 52 [2018-12-24 14:28:27,204 INFO L226 Difference]: Without dead ends: 49 [2018-12-24 14:28:27,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-12-24 14:28:27,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-24 14:28:27,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 26. [2018-12-24 14:28:27,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-24 14:28:27,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 78 transitions. [2018-12-24 14:28:27,215 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 78 transitions. Word has length 4 [2018-12-24 14:28:27,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:27,216 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 78 transitions. [2018-12-24 14:28:27,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 14:28:27,216 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 78 transitions. [2018-12-24 14:28:27,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 14:28:27,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:27,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 14:28:27,217 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:27,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:27,217 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2018-12-24 14:28:27,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:27,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:27,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:27,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:27,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:27,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:27,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:27,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:27,255 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 14:28:27,256 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2018-12-24 14:28:27,259 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:28:27,259 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:28:27,430 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:28:27,431 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 14:28:27,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:27,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:28:27,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:27,431 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 [2018-12-24 14:28:27,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:27,440 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:28:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:27,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:27,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:27,464 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 [2018-12-24 14:28:27,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:27,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:27,501 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 [2018-12-24 14:28:27,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:27,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:27,525 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 [2018-12-24 14:28:27,528 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 [2018-12-24 14:28:27,532 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 [2018-12-24 14:28:27,542 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 [2018-12-24 14:28:27,543 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:27,564 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:27,576 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:27,586 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:27,602 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. [2018-12-24 14:28:27,603 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2018-12-24 14:28:27,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:27,648 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 [2018-12-24 14:28:27,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:27,675 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. [2018-12-24 14:28:27,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2018-12-24 14:28:27,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:27,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:27,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:27,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:27,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 14:28:27,732 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:27,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 14:28:27,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 14:28:27,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 14:28:27,733 INFO L87 Difference]: Start difference. First operand 26 states and 78 transitions. Second operand 6 states. [2018-12-24 14:28:27,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:27,962 INFO L93 Difference]: Finished difference Result 36 states and 91 transitions. [2018-12-24 14:28:27,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 14:28:27,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-24 14:28:27,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:27,964 INFO L225 Difference]: With dead ends: 36 [2018-12-24 14:28:27,964 INFO L226 Difference]: Without dead ends: 35 [2018-12-24 14:28:27,965 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 [2018-12-24 14:28:27,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-24 14:28:27,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2018-12-24 14:28:27,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-24 14:28:27,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 84 transitions. [2018-12-24 14:28:27,973 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 84 transitions. Word has length 4 [2018-12-24 14:28:27,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:27,973 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 84 transitions. [2018-12-24 14:28:27,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 14:28:27,973 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 84 transitions. [2018-12-24 14:28:27,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 14:28:27,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:27,974 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 14:28:27,974 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:27,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:27,974 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2018-12-24 14:28:27,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:27,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:27,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:27,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:27,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:28,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:28,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:28,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:28,047 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 14:28:28,047 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2018-12-24 14:28:28,048 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:28:28,048 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:28:28,311 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:28:28,311 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 14:28:28,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:28,312 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:28:28,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:28,312 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 [2018-12-24 14:28:28,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:28,321 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:28:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:28,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:28,360 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 [2018-12-24 14:28:28,365 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 [2018-12-24 14:28:28,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:28,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:28,371 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 [2018-12-24 14:28:28,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:28,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:28,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:28,382 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 [2018-12-24 14:28:28,383 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:28,428 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:28,446 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:28,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:28,473 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:28,474 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 [2018-12-24 14:28:28,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:28,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:28,508 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 [2018-12-24 14:28:28,557 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:28,566 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:28,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:28,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:28,568 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 [2018-12-24 14:28:28,569 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:28,577 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:28,626 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:28,644 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. [2018-12-24 14:28:28,645 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 14:28:28,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:28,720 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 [2018-12-24 14:28:28,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:28,739 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. [2018-12-24 14:28:28,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 14:28:28,768 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:28,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:28,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:28,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:28,771 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:28,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:28,773 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 [2018-12-24 14:28:28,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:28,798 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. [2018-12-24 14:28:28,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-12-24 14:28:28,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:28,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:28,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:28,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:28,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 14:28:28,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:28,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 14:28:28,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 14:28:28,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-24 14:28:28,857 INFO L87 Difference]: Start difference. First operand 28 states and 84 transitions. Second operand 8 states. [2018-12-24 14:28:29,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:29,219 INFO L93 Difference]: Finished difference Result 52 states and 123 transitions. [2018-12-24 14:28:29,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 14:28:29,220 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-24 14:28:29,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:29,221 INFO L225 Difference]: With dead ends: 52 [2018-12-24 14:28:29,221 INFO L226 Difference]: Without dead ends: 50 [2018-12-24 14:28:29,222 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 [2018-12-24 14:28:29,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-24 14:28:29,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2018-12-24 14:28:29,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-24 14:28:29,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 99 transitions. [2018-12-24 14:28:29,232 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 99 transitions. Word has length 4 [2018-12-24 14:28:29,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:29,232 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 99 transitions. [2018-12-24 14:28:29,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 14:28:29,233 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 99 transitions. [2018-12-24 14:28:29,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 14:28:29,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:29,234 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 14:28:29,234 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:29,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:29,234 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2018-12-24 14:28:29,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:29,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:29,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:29,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:29,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:29,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:29,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:29,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:29,291 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 14:28:29,291 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [21] [2018-12-24 14:28:29,292 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:28:29,292 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:28:29,453 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:28:29,453 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 14:28:29,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:29,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:28:29,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:29,454 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 [2018-12-24 14:28:29,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:29,465 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:28:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:29,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:29,474 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 [2018-12-24 14:28:29,479 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 [2018-12-24 14:28:29,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:29,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:29,520 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 [2018-12-24 14:28:29,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:29,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:29,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:29,538 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 [2018-12-24 14:28:29,539 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:29,561 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:29,570 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:29,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:29,595 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 [2018-12-24 14:28:29,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:29,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:29,616 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 [2018-12-24 14:28:29,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:29,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:29,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:29,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:29,650 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 [2018-12-24 14:28:29,651 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:29,778 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:29,788 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:29,809 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. [2018-12-24 14:28:29,810 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:41, output treesize:41 [2018-12-24 14:28:29,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:29,864 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 [2018-12-24 14:28:29,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:29,883 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. [2018-12-24 14:28:29,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2018-12-24 14:28:29,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:29,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:29,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:29,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:29,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 14:28:29,939 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:29,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 14:28:29,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 14:28:29,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 14:28:29,940 INFO L87 Difference]: Start difference. First operand 31 states and 99 transitions. Second operand 6 states. [2018-12-24 14:28:30,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:30,061 INFO L93 Difference]: Finished difference Result 39 states and 105 transitions. [2018-12-24 14:28:30,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 14:28:30,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-24 14:28:30,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:30,062 INFO L225 Difference]: With dead ends: 39 [2018-12-24 14:28:30,062 INFO L226 Difference]: Without dead ends: 38 [2018-12-24 14:28:30,063 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 [2018-12-24 14:28:30,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-24 14:28:30,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2018-12-24 14:28:30,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-24 14:28:30,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2018-12-24 14:28:30,072 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 4 [2018-12-24 14:28:30,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:30,073 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2018-12-24 14:28:30,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 14:28:30,073 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2018-12-24 14:28:30,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 14:28:30,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:30,074 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-24 14:28:30,074 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:30,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:30,075 INFO L82 PathProgramCache]: Analyzing trace with hash 29121388, now seen corresponding path program 2 times [2018-12-24 14:28:30,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:30,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:30,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:30,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:30,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:28:30,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:30,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:30,168 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:28:30,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:28:30,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:30,169 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 [2018-12-24 14:28:30,181 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:28:30,181 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:28:30,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 14:28:30,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:28:30,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:30,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:30,207 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 [2018-12-24 14:28:30,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:30,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:30,240 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 [2018-12-24 14:28:30,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:30,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:30,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:30,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:30,274 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 [2018-12-24 14:28:30,275 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:30,285 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:30,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:30,312 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 [2018-12-24 14:28:30,315 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 [2018-12-24 14:28:30,320 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 [2018-12-24 14:28:30,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, 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 [2018-12-24 14:28:30,338 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:30,354 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:30,363 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:30,372 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:30,391 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. [2018-12-24 14:28:30,392 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2018-12-24 14:28:30,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:30,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, 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 [2018-12-24 14:28:30,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:30,433 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. [2018-12-24 14:28:30,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 14:28:30,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:30,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:30,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:30,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:30,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:30,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:30,471 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 [2018-12-24 14:28:30,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:30,495 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. [2018-12-24 14:28:30,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:33 [2018-12-24 14:28:30,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:30,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:30,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:30,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:30,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:30,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:30,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 59 [2018-12-24 14:28:30,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:30,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. [2018-12-24 14:28:30,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-12-24 14:28:30,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:30,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:30,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:30,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:30,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2018-12-24 14:28:30,606 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:30,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-24 14:28:30,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-24 14:28:30,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-12-24 14:28:30,607 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 9 states. [2018-12-24 14:28:30,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:30,963 INFO L93 Difference]: Finished difference Result 65 states and 148 transitions. [2018-12-24 14:28:30,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 14:28:30,963 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2018-12-24 14:28:30,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:30,964 INFO L225 Difference]: With dead ends: 65 [2018-12-24 14:28:30,964 INFO L226 Difference]: Without dead ends: 60 [2018-12-24 14:28:30,965 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 [2018-12-24 14:28:30,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-24 14:28:30,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 32. [2018-12-24 14:28:30,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-24 14:28:30,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2018-12-24 14:28:30,978 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2018-12-24 14:28:30,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:30,978 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2018-12-24 14:28:30,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-24 14:28:30,978 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2018-12-24 14:28:30,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 14:28:30,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:30,979 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-24 14:28:30,979 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:30,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:30,979 INFO L82 PathProgramCache]: Analyzing trace with hash 29121636, now seen corresponding path program 2 times [2018-12-24 14:28:30,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:30,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:30,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:28:30,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:30,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:31,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:28:31,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:31,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:31,100 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:28:31,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:28:31,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:31,101 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 [2018-12-24 14:28:31,110 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:28:31,110 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:28:31,116 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 14:28:31,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:28:31,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:31,139 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 [2018-12-24 14:28:31,143 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 [2018-12-24 14:28:31,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:31,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:31,147 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 [2018-12-24 14:28:31,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:31,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:31,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:31,157 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 [2018-12-24 14:28:31,158 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:31,177 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:31,188 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:31,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:31,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:31,219 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 [2018-12-24 14:28:31,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:31,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:31,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 [2018-12-24 14:28:31,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:31,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:31,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:31,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:31,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 [2018-12-24 14:28:31,297 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:31,306 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:31,316 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:31,335 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. [2018-12-24 14:28:31,335 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 14:28:31,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:31,359 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 [2018-12-24 14:28:31,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:31,379 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. [2018-12-24 14:28:31,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 14:28:31,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:31,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:31,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:31,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:31,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:31,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:31,407 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 [2018-12-24 14:28:31,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:31,433 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. [2018-12-24 14:28:31,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2018-12-24 14:28:31,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:31,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:31,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:31,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:31,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:31,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:31,461 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 [2018-12-24 14:28:31,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:31,486 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. [2018-12-24 14:28:31,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-12-24 14:28:31,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:31,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:31,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:31,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:31,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2018-12-24 14:28:31,580 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:31,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-24 14:28:31,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-24 14:28:31,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-12-24 14:28:31,581 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 9 states. [2018-12-24 14:28:31,827 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-12-24 14:28:32,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:32,077 INFO L93 Difference]: Finished difference Result 53 states and 146 transitions. [2018-12-24 14:28:32,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 14:28:32,078 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2018-12-24 14:28:32,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:32,079 INFO L225 Difference]: With dead ends: 53 [2018-12-24 14:28:32,079 INFO L226 Difference]: Without dead ends: 51 [2018-12-24 14:28:32,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-12-24 14:28:32,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-24 14:28:32,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-12-24 14:28:32,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-24 14:28:32,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2018-12-24 14:28:32,090 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2018-12-24 14:28:32,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:32,090 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2018-12-24 14:28:32,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-24 14:28:32,091 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2018-12-24 14:28:32,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 14:28:32,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:32,091 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 14:28:32,092 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:32,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:32,092 INFO L82 PathProgramCache]: Analyzing trace with hash 29112214, now seen corresponding path program 1 times [2018-12-24 14:28:32,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:32,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:32,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:28:32,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:32,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:32,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:32,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:32,141 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:32,141 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 14:28:32,141 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [21] [2018-12-24 14:28:32,143 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:28:32,143 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:28:32,875 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:28:32,875 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 14:28:32,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:32,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:28:32,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:32,876 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 [2018-12-24 14:28:32,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:32,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:28:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:32,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:33,024 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-12-24 14:28:33,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:33,028 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 [2018-12-24 14:28:33,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:33,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:33,056 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 [2018-12-24 14:28:33,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:33,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:33,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:33,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:33,088 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 [2018-12-24 14:28:33,089 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:33,098 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:33,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:33,123 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 [2018-12-24 14:28:33,126 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 [2018-12-24 14:28:33,129 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 [2018-12-24 14:28:33,132 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 [2018-12-24 14:28:33,133 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:33,147 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:33,155 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:33,163 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:33,182 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. [2018-12-24 14:28:33,183 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 14:28:33,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:33,213 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 [2018-12-24 14:28:33,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:33,230 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. [2018-12-24 14:28:33,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 14:28:33,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:33,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:33,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:33,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:33,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:33,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:33,256 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 [2018-12-24 14:28:33,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:33,278 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. [2018-12-24 14:28:33,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-12-24 14:28:33,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:33,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:33,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:33,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:33,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 14:28:33,342 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:33,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 14:28:33,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 14:28:33,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-24 14:28:33,343 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 8 states. [2018-12-24 14:28:33,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:33,589 INFO L93 Difference]: Finished difference Result 54 states and 147 transitions. [2018-12-24 14:28:33,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 14:28:33,589 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 14:28:33,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:33,591 INFO L225 Difference]: With dead ends: 54 [2018-12-24 14:28:33,591 INFO L226 Difference]: Without dead ends: 53 [2018-12-24 14:28:33,592 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 [2018-12-24 14:28:33,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-24 14:28:33,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2018-12-24 14:28:33,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-24 14:28:33,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2018-12-24 14:28:33,603 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 122 transitions. Word has length 5 [2018-12-24 14:28:33,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:33,603 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 122 transitions. [2018-12-24 14:28:33,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 14:28:33,604 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 122 transitions. [2018-12-24 14:28:33,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 14:28:33,604 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:33,604 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 14:28:33,605 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:33,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:33,605 INFO L82 PathProgramCache]: Analyzing trace with hash 29115622, now seen corresponding path program 1 times [2018-12-24 14:28:33,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:33,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:33,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:33,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:33,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:33,741 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:33,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:33,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:33,742 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 14:28:33,743 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2018-12-24 14:28:33,744 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:28:33,744 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:28:34,535 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:28:34,535 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-24 14:28:34,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:34,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:28:34,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:34,535 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 [2018-12-24 14:28:34,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:34,546 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:28:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:34,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:34,574 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 [2018-12-24 14:28:34,584 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 [2018-12-24 14:28:34,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:34,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:34,631 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 [2018-12-24 14:28:34,640 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 [2018-12-24 14:28:34,640 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:34,652 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:34,662 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:34,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:34,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:34,688 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 [2018-12-24 14:28:34,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:34,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:34,711 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 [2018-12-24 14:28:34,711 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:34,715 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:34,728 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. [2018-12-24 14:28:34,729 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2018-12-24 14:28:34,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:34,772 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 [2018-12-24 14:28:34,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2018-12-24 14:28:34,854 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. [2018-12-24 14:28:34,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:108 [2018-12-24 14:28:34,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:34,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:34,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:34,936 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:28:34,937 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 36 treesize of output 49 [2018-12-24 14:28:34,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:34,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:34,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:34,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:34,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:34,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:34,997 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 [2018-12-24 14:28:34,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:35,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:35,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:35,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:35,044 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:28:35,045 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 41 [2018-12-24 14:28:35,046 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:35,080 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. [2018-12-24 14:28:35,080 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:105, output treesize:61 [2018-12-24 14:28:35,506 WARN L181 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-24 14:28:35,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:35,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:35,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:35,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:35,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:35,580 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 [2018-12-24 14:28:35,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:35,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:35,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:35,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:35,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:35,625 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:28:35,626 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 36 [2018-12-24 14:28:35,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:35,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:35,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:35,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:35,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:35,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:35,671 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 54 [2018-12-24 14:28:35,671 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:35,710 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. [2018-12-24 14:28:35,711 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:101, output treesize:65 [2018-12-24 14:28:35,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:35,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:35,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:35,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:35,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2018-12-24 14:28:35,789 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:35,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 14:28:35,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 14:28:35,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-12-24 14:28:35,790 INFO L87 Difference]: Start difference. First operand 35 states and 122 transitions. Second operand 10 states. [2018-12-24 14:28:36,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:36,677 INFO L93 Difference]: Finished difference Result 81 states and 236 transitions. [2018-12-24 14:28:36,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-24 14:28:36,680 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-12-24 14:28:36,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:36,681 INFO L225 Difference]: With dead ends: 81 [2018-12-24 14:28:36,681 INFO L226 Difference]: Without dead ends: 80 [2018-12-24 14:28:36,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-12-24 14:28:36,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-24 14:28:36,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 40. [2018-12-24 14:28:36,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-24 14:28:36,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 148 transitions. [2018-12-24 14:28:36,696 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 148 transitions. Word has length 5 [2018-12-24 14:28:36,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:36,696 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 148 transitions. [2018-12-24 14:28:36,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 14:28:36,697 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 148 transitions. [2018-12-24 14:28:36,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 14:28:36,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:36,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 14:28:36,698 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:36,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:36,698 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2018-12-24 14:28:36,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:36,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:36,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:36,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:36,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:36,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:36,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:36,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:36,785 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 14:28:36,785 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2018-12-24 14:28:36,786 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:28:36,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:28:37,591 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:28:37,591 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-24 14:28:37,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:37,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:28:37,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:37,591 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 [2018-12-24 14:28:37,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:37,600 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:28:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:37,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:37,621 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 [2018-12-24 14:28:37,624 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 [2018-12-24 14:28:37,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:37,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:37,632 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 [2018-12-24 14:28:37,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:37,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:37,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:37,639 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 [2018-12-24 14:28:37,640 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:37,662 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:37,681 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:37,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:37,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:37,717 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 [2018-12-24 14:28:37,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:37,766 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:37,766 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 [2018-12-24 14:28:37,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:37,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:37,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:37,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:37,816 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 [2018-12-24 14:28:37,816 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:37,834 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:37,846 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:37,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:37,869 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2018-12-24 14:28:37,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:37,918 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 [2018-12-24 14:28:37,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:37,948 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. [2018-12-24 14:28:37,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 14:28:37,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:37,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:37,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:37,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:37,976 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:28:37,977 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 [2018-12-24 14:28:37,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:37,999 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. [2018-12-24 14:28:37,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:29 [2018-12-24 14:28:38,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:38,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:38,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:38,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:38,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:38,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:38,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:38,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 35 treesize of output 69 [2018-12-24 14:28:38,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:38,058 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. [2018-12-24 14:28:38,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2018-12-24 14:28:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:38,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:38,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:38,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:38,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 14:28:38,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:38,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 14:28:38,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 14:28:38,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-12-24 14:28:38,987 INFO L87 Difference]: Start difference. First operand 40 states and 148 transitions. Second operand 10 states. [2018-12-24 14:28:39,641 WARN L181 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2018-12-24 14:28:40,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:40,138 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2018-12-24 14:28:40,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 14:28:40,139 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-12-24 14:28:40,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:40,140 INFO L225 Difference]: With dead ends: 66 [2018-12-24 14:28:40,140 INFO L226 Difference]: Without dead ends: 64 [2018-12-24 14:28:40,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2018-12-24 14:28:40,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-24 14:28:40,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 41. [2018-12-24 14:28:40,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-24 14:28:40,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2018-12-24 14:28:40,157 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2018-12-24 14:28:40,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:40,158 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2018-12-24 14:28:40,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 14:28:40,158 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2018-12-24 14:28:40,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 14:28:40,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:40,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 14:28:40,159 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:40,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:40,159 INFO L82 PathProgramCache]: Analyzing trace with hash 29119902, now seen corresponding path program 1 times [2018-12-24 14:28:40,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:40,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:40,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:40,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:40,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:40,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:40,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:40,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:40,262 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 14:28:40,262 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [21] [2018-12-24 14:28:40,264 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:28:40,264 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:28:40,864 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:28:40,864 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 14:28:40,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:40,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:28:40,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:40,865 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 [2018-12-24 14:28:40,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:40,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:28:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:40,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:40,920 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 [2018-12-24 14:28:41,028 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-24 14:28:41,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:41,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:41,101 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 [2018-12-24 14:28:41,368 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2018-12-24 14:28:41,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:41,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:41,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:41,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:41,386 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 [2018-12-24 14:28:41,387 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:41,394 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:41,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:41,476 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 [2018-12-24 14:28:41,479 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 [2018-12-24 14:28:41,511 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 [2018-12-24 14:28:41,519 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 [2018-12-24 14:28:41,520 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:41,532 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:41,540 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:41,548 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:41,565 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. [2018-12-24 14:28:41,566 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2018-12-24 14:28:41,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:41,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, 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 [2018-12-24 14:28:41,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:41,604 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. [2018-12-24 14:28:41,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2018-12-24 14:28:41,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:41,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:41,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:41,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:41,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:41,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, 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 [2018-12-24 14:28:41,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:41,677 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. [2018-12-24 14:28:41,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2018-12-24 14:28:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:41,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:41,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:41,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:41,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2018-12-24 14:28:41,739 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:41,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 14:28:41,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 14:28:41,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-12-24 14:28:41,739 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 8 states. [2018-12-24 14:28:41,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:41,965 INFO L93 Difference]: Finished difference Result 62 states and 176 transitions. [2018-12-24 14:28:41,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 14:28:41,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 14:28:41,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:41,967 INFO L225 Difference]: With dead ends: 62 [2018-12-24 14:28:41,967 INFO L226 Difference]: Without dead ends: 61 [2018-12-24 14:28:41,968 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 [2018-12-24 14:28:41,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-24 14:28:41,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2018-12-24 14:28:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-24 14:28:41,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 137 transitions. [2018-12-24 14:28:41,984 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 137 transitions. Word has length 5 [2018-12-24 14:28:41,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:41,985 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 137 transitions. [2018-12-24 14:28:41,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 14:28:41,985 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 137 transitions. [2018-12-24 14:28:41,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 14:28:41,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:41,986 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 14:28:41,986 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:41,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:41,987 INFO L82 PathProgramCache]: Analyzing trace with hash 28827822, now seen corresponding path program 1 times [2018-12-24 14:28:41,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:41,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:41,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:41,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:41,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:42,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:28:42,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 14:28:42,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-24 14:28:42,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 14:28:42,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 14:28:42,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 14:28:42,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-24 14:28:42,038 INFO L87 Difference]: Start difference. First operand 38 states and 137 transitions. Second operand 4 states. [2018-12-24 14:28:42,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:42,111 INFO L93 Difference]: Finished difference Result 51 states and 158 transitions. [2018-12-24 14:28:42,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-24 14:28:42,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-24 14:28:42,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:42,113 INFO L225 Difference]: With dead ends: 51 [2018-12-24 14:28:42,113 INFO L226 Difference]: Without dead ends: 46 [2018-12-24 14:28:42,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-24 14:28:42,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-24 14:28:42,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2018-12-24 14:28:42,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-24 14:28:42,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 145 transitions. [2018-12-24 14:28:42,128 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 145 transitions. Word has length 5 [2018-12-24 14:28:42,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:42,129 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 145 transitions. [2018-12-24 14:28:42,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 14:28:42,129 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 145 transitions. [2018-12-24 14:28:42,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 14:28:42,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:42,130 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 14:28:42,130 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:42,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:42,130 INFO L82 PathProgramCache]: Analyzing trace with hash 28818022, now seen corresponding path program 2 times [2018-12-24 14:28:42,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:42,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:42,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:42,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:42,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:42,347 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2018-12-24 14:28:42,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:42,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:42,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:42,391 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:28:42,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:28:42,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:42,391 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 [2018-12-24 14:28:42,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:28:42,402 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:28:42,406 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 14:28:42,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:28:42,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:42,423 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 [2018-12-24 14:28:42,426 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 [2018-12-24 14:28:42,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:42,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:42,431 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 [2018-12-24 14:28:42,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:42,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:42,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:42,446 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 [2018-12-24 14:28:42,446 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:42,463 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:42,472 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:42,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:42,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:42,502 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 [2018-12-24 14:28:42,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:42,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:42,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 14:28:42,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:42,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:42,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:42,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:42,564 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 [2018-12-24 14:28:42,565 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:42,574 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:42,584 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:42,603 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. [2018-12-24 14:28:42,604 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 14:28:42,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:42,628 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 [2018-12-24 14:28:42,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:42,676 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. [2018-12-24 14:28:42,676 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 14:28:42,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:42,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:42,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:42,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:42,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:42,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:42,702 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 [2018-12-24 14:28:42,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:42,731 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. [2018-12-24 14:28:42,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2018-12-24 14:28:42,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:42,768 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:42,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:42,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:42,774 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:42,774 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:42,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:42,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:42,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:42,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:42,808 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:28:42,809 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 [2018-12-24 14:28:42,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:42,871 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. [2018-12-24 14:28:42,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2018-12-24 14:28:42,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:42,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:42,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:42,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:42,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-24 14:28:42,972 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:42,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 14:28:42,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 14:28:42,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-12-24 14:28:42,973 INFO L87 Difference]: Start difference. First operand 39 states and 145 transitions. Second operand 10 states. [2018-12-24 14:28:43,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:43,772 INFO L93 Difference]: Finished difference Result 90 states and 270 transitions. [2018-12-24 14:28:43,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 14:28:43,772 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-12-24 14:28:43,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:43,774 INFO L225 Difference]: With dead ends: 90 [2018-12-24 14:28:43,774 INFO L226 Difference]: Without dead ends: 87 [2018-12-24 14:28:43,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2018-12-24 14:28:43,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-24 14:28:43,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 47. [2018-12-24 14:28:43,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-24 14:28:43,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 178 transitions. [2018-12-24 14:28:43,799 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 178 transitions. Word has length 5 [2018-12-24 14:28:43,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:43,799 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 178 transitions. [2018-12-24 14:28:43,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 14:28:43,799 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 178 transitions. [2018-12-24 14:28:43,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 14:28:43,800 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:43,800 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 14:28:43,800 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:43,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:43,800 INFO L82 PathProgramCache]: Analyzing trace with hash 28818148, now seen corresponding path program 1 times [2018-12-24 14:28:43,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:43,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:43,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:28:43,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:43,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:43,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:43,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:43,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:43,883 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 14:28:43,883 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [21] [2018-12-24 14:28:43,884 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:28:43,884 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:28:44,133 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:28:44,133 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 14:28:44,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:44,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:28:44,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:44,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 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 [2018-12-24 14:28:44,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:44,142 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:28:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:44,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:44,168 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 [2018-12-24 14:28:44,171 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 [2018-12-24 14:28:44,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:44,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:44,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 [2018-12-24 14:28:44,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:44,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:44,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:44,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 [2018-12-24 14:28:44,189 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:44,215 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:44,225 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:44,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:44,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:44,255 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 [2018-12-24 14:28:44,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:44,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:44,286 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 [2018-12-24 14:28:44,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:44,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:44,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:44,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:44,319 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 [2018-12-24 14:28:44,319 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:44,350 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:44,359 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:44,378 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. [2018-12-24 14:28:44,379 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2018-12-24 14:28:44,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:44,402 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 [2018-12-24 14:28:44,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:44,419 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. [2018-12-24 14:28:44,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2018-12-24 14:28:44,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:44,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:44,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:44,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:44,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:44,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:44,444 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 [2018-12-24 14:28:44,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:44,468 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. [2018-12-24 14:28:44,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2018-12-24 14:28:44,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:44,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:44,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:44,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:44,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2018-12-24 14:28:44,530 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:44,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 14:28:44,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 14:28:44,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-12-24 14:28:44,530 INFO L87 Difference]: Start difference. First operand 47 states and 178 transitions. Second operand 8 states. [2018-12-24 14:28:44,730 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-12-24 14:28:44,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:44,856 INFO L93 Difference]: Finished difference Result 66 states and 232 transitions. [2018-12-24 14:28:44,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 14:28:44,857 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 14:28:44,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:44,858 INFO L225 Difference]: With dead ends: 66 [2018-12-24 14:28:44,858 INFO L226 Difference]: Without dead ends: 65 [2018-12-24 14:28:44,859 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 [2018-12-24 14:28:44,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-24 14:28:44,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2018-12-24 14:28:44,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-24 14:28:44,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 209 transitions. [2018-12-24 14:28:44,885 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 209 transitions. Word has length 5 [2018-12-24 14:28:44,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:44,886 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 209 transitions. [2018-12-24 14:28:44,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 14:28:44,886 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 209 transitions. [2018-12-24 14:28:44,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 14:28:44,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:44,887 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 14:28:44,887 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:44,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:44,887 INFO L82 PathProgramCache]: Analyzing trace with hash 28821992, now seen corresponding path program 1 times [2018-12-24 14:28:44,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:44,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:44,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:44,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:44,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:44,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:28:44,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:44,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:44,949 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 14:28:44,950 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [21] [2018-12-24 14:28:44,951 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:28:44,951 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:28:45,297 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:28:45,297 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 14:28:45,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:45,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:28:45,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:45,298 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 [2018-12-24 14:28:45,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:45,315 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:28:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:45,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:45,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:45,396 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 [2018-12-24 14:28:45,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:45,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:45,422 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 [2018-12-24 14:28:45,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:45,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:45,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:45,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:45,453 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 [2018-12-24 14:28:45,454 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:45,464 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:45,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:45,489 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 [2018-12-24 14:28:45,492 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 [2018-12-24 14:28:45,494 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 [2018-12-24 14:28:45,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, 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 [2018-12-24 14:28:45,497 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:45,511 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:45,521 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:45,529 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:45,548 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. [2018-12-24 14:28:45,549 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 14:28:45,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:45,672 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 [2018-12-24 14:28:45,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:45,732 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. [2018-12-24 14:28:45,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 14:28:45,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:45,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:45,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:45,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:45,757 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:28:45,758 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 [2018-12-24 14:28:45,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:45,777 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. [2018-12-24 14:28:45,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2018-12-24 14:28:45,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:45,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:45,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:45,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:45,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2018-12-24 14:28:45,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:45,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-24 14:28:45,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-24 14:28:45,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-12-24 14:28:45,831 INFO L87 Difference]: Start difference. First operand 53 states and 209 transitions. Second operand 7 states. [2018-12-24 14:28:46,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:46,069 INFO L93 Difference]: Finished difference Result 63 states and 221 transitions. [2018-12-24 14:28:46,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 14:28:46,071 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2018-12-24 14:28:46,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:46,072 INFO L225 Difference]: With dead ends: 63 [2018-12-24 14:28:46,072 INFO L226 Difference]: Without dead ends: 62 [2018-12-24 14:28:46,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-12-24 14:28:46,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-24 14:28:46,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2018-12-24 14:28:46,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-24 14:28:46,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 207 transitions. [2018-12-24 14:28:46,093 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 207 transitions. Word has length 5 [2018-12-24 14:28:46,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:46,093 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 207 transitions. [2018-12-24 14:28:46,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-24 14:28:46,093 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 207 transitions. [2018-12-24 14:28:46,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 14:28:46,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:46,094 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 14:28:46,094 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:46,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:46,095 INFO L82 PathProgramCache]: Analyzing trace with hash 28933468, now seen corresponding path program 2 times [2018-12-24 14:28:46,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:46,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:46,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:46,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:46,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:46,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:46,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:46,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:46,149 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:28:46,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:28:46,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:46,150 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 [2018-12-24 14:28:46,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:28:46,162 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:28:46,166 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-24 14:28:46,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:28:46,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:46,185 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 [2018-12-24 14:28:46,188 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 [2018-12-24 14:28:46,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:46,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:46,196 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 [2018-12-24 14:28:46,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:46,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:46,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:46,201 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 [2018-12-24 14:28:46,202 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:46,220 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:46,230 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:46,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:46,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:46,259 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 [2018-12-24 14:28:46,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:46,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:46,287 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 [2018-12-24 14:28:46,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:46,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:46,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:46,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:46,318 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 [2018-12-24 14:28:46,319 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:46,328 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:46,337 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:46,356 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. [2018-12-24 14:28:46,356 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2018-12-24 14:28:46,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:46,378 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 [2018-12-24 14:28:46,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:46,396 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. [2018-12-24 14:28:46,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 14:28:46,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:46,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:46,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:46,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:46,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:46,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:46,417 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 [2018-12-24 14:28:46,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:46,437 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. [2018-12-24 14:28:46,438 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-12-24 14:28:46,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:46,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:46,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:46,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 14:28:46,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:46,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 14:28:46,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 14:28:46,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-24 14:28:46,494 INFO L87 Difference]: Start difference. First operand 52 states and 207 transitions. Second operand 8 states. [2018-12-24 14:28:46,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:46,698 INFO L93 Difference]: Finished difference Result 86 states and 292 transitions. [2018-12-24 14:28:46,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 14:28:46,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 14:28:46,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:46,700 INFO L225 Difference]: With dead ends: 86 [2018-12-24 14:28:46,700 INFO L226 Difference]: Without dead ends: 85 [2018-12-24 14:28:46,701 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 [2018-12-24 14:28:46,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-24 14:28:46,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 61. [2018-12-24 14:28:46,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-24 14:28:46,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 254 transitions. [2018-12-24 14:28:46,726 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 254 transitions. Word has length 5 [2018-12-24 14:28:46,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:46,726 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 254 transitions. [2018-12-24 14:28:46,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 14:28:46,727 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 254 transitions. [2018-12-24 14:28:46,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 14:28:46,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:46,728 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-24 14:28:46,728 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:46,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:46,728 INFO L82 PathProgramCache]: Analyzing trace with hash 902762954, now seen corresponding path program 3 times [2018-12-24 14:28:46,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:46,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:46,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:28:46,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:46,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:46,843 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-24 14:28:46,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:46,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:46,844 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:28:46,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:28:46,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:46,844 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 [2018-12-24 14:28:46,856 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:28:46,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:28:46,860 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:28:46,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:28:46,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:46,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:46,877 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 [2018-12-24 14:28:46,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:46,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:46,914 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 [2018-12-24 14:28:46,943 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:46,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:46,945 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:46,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:46,947 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 [2018-12-24 14:28:46,948 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:46,957 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:46,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:46,983 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 [2018-12-24 14:28:46,986 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 [2018-12-24 14:28:46,989 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 [2018-12-24 14:28:46,993 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 [2018-12-24 14:28:46,993 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:47,009 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:47,019 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:47,027 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:47,047 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. [2018-12-24 14:28:47,048 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2018-12-24 14:28:47,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:47,068 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 [2018-12-24 14:28:47,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:47,086 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. [2018-12-24 14:28:47,087 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 14:28:47,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:47,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:47,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:47,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:47,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:47,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:47,109 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 [2018-12-24 14:28:47,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:47,130 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. [2018-12-24 14:28:47,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2018-12-24 14:28:47,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:47,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:47,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:47,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:47,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:47,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:47,156 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 [2018-12-24 14:28:47,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:47,178 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. [2018-12-24 14:28:47,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2018-12-24 14:28:47,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:47,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:47,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:47,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:47,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:47,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:47,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:47,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:47,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:47,204 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:47,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:47,206 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 [2018-12-24 14:28:47,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:47,235 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. [2018-12-24 14:28:47,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2018-12-24 14:28:47,255 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:47,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:47,298 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:47,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:47,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2018-12-24 14:28:47,322 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:47,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 14:28:47,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 14:28:47,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2018-12-24 14:28:47,323 INFO L87 Difference]: Start difference. First operand 61 states and 254 transitions. Second operand 10 states. [2018-12-24 14:28:47,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:47,785 INFO L93 Difference]: Finished difference Result 96 states and 318 transitions. [2018-12-24 14:28:47,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 14:28:47,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-24 14:28:47,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:47,787 INFO L225 Difference]: With dead ends: 96 [2018-12-24 14:28:47,787 INFO L226 Difference]: Without dead ends: 90 [2018-12-24 14:28:47,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-12-24 14:28:47,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-24 14:28:47,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2018-12-24 14:28:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-24 14:28:47,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 276 transitions. [2018-12-24 14:28:47,814 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 276 transitions. Word has length 6 [2018-12-24 14:28:47,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:47,814 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 276 transitions. [2018-12-24 14:28:47,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 14:28:47,815 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 276 transitions. [2018-12-24 14:28:47,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 14:28:47,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:47,815 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-24 14:28:47,815 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:47,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:47,816 INFO L82 PathProgramCache]: Analyzing trace with hash 902762768, now seen corresponding path program 3 times [2018-12-24 14:28:47,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:47,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:47,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:28:47,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:47,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:47,925 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:28:47,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:47,925 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:47,925 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:28:47,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:28:47,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:47,926 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 [2018-12-24 14:28:47,936 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:28:47,936 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:28:47,940 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:28:47,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:28:47,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:47,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:47,961 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 [2018-12-24 14:28:48,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,014 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 [2018-12-24 14:28:48,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,075 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,080 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 [2018-12-24 14:28:48,080 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:48,092 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:48,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:48,119 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 [2018-12-24 14:28:48,121 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 [2018-12-24 14:28:48,124 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 [2018-12-24 14:28:48,128 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 [2018-12-24 14:28:48,128 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:48,154 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:48,173 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:48,188 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:48,212 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. [2018-12-24 14:28:48,213 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 14:28:48,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,239 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 [2018-12-24 14:28:48,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:48,258 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. [2018-12-24 14:28:48,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 14:28:48,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,286 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 [2018-12-24 14:28:48,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:48,308 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. [2018-12-24 14:28:48,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2018-12-24 14:28:48,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,380 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 [2018-12-24 14:28:48,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:48,403 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. [2018-12-24 14:28:48,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2018-12-24 14:28:48,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,486 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:48,504 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 [2018-12-24 14:28:48,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:48,530 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. [2018-12-24 14:28:48,531 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2018-12-24 14:28:48,548 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:48,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:48,631 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:48,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:48,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2018-12-24 14:28:48,652 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:48,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 14:28:48,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 14:28:48,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2018-12-24 14:28:48,653 INFO L87 Difference]: Start difference. First operand 66 states and 276 transitions. Second operand 11 states. [2018-12-24 14:28:49,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:49,110 INFO L93 Difference]: Finished difference Result 107 states and 377 transitions. [2018-12-24 14:28:49,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 14:28:49,111 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2018-12-24 14:28:49,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:49,112 INFO L225 Difference]: With dead ends: 107 [2018-12-24 14:28:49,112 INFO L226 Difference]: Without dead ends: 106 [2018-12-24 14:28:49,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2018-12-24 14:28:49,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-24 14:28:49,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2018-12-24 14:28:49,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-24 14:28:49,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 321 transitions. [2018-12-24 14:28:49,146 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 321 transitions. Word has length 6 [2018-12-24 14:28:49,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:49,146 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 321 transitions. [2018-12-24 14:28:49,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 14:28:49,146 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 321 transitions. [2018-12-24 14:28:49,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 14:28:49,147 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:49,147 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-24 14:28:49,147 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:49,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:49,148 INFO L82 PathProgramCache]: Analyzing trace with hash 902474468, now seen corresponding path program 4 times [2018-12-24 14:28:49,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:49,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:49,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:28:49,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:49,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:49,271 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:28:49,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:49,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:49,272 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:28:49,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:28:49,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:49,272 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 [2018-12-24 14:28:49,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:49,281 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:28:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:49,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:49,303 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 [2018-12-24 14:28:49,306 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 [2018-12-24 14:28:49,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,311 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 [2018-12-24 14:28:49,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,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, 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 [2018-12-24 14:28:49,317 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:49,335 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:49,346 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:49,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:49,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,376 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 [2018-12-24 14:28:49,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,405 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 [2018-12-24 14:28:49,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,436 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 [2018-12-24 14:28:49,437 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:49,447 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:49,457 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:49,477 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. [2018-12-24 14:28:49,477 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 14:28:49,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,504 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 [2018-12-24 14:28:49,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:49,523 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. [2018-12-24 14:28:49,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 14:28:49,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,548 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,551 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 [2018-12-24 14:28:49,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:49,572 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. [2018-12-24 14:28:49,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2018-12-24 14:28:49,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,604 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 [2018-12-24 14:28:49,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:49,629 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. [2018-12-24 14:28:49,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:25 [2018-12-24 14:28:49,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:49,661 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 [2018-12-24 14:28:49,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:49,689 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. [2018-12-24 14:28:49,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2018-12-24 14:28:49,708 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:49,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:49,760 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:49,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:49,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2018-12-24 14:28:49,781 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:49,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 14:28:49,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 14:28:49,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2018-12-24 14:28:49,782 INFO L87 Difference]: Start difference. First operand 75 states and 321 transitions. Second operand 11 states. [2018-12-24 14:28:50,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:50,228 INFO L93 Difference]: Finished difference Result 116 states and 391 transitions. [2018-12-24 14:28:50,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 14:28:50,229 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2018-12-24 14:28:50,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:50,231 INFO L225 Difference]: With dead ends: 116 [2018-12-24 14:28:50,231 INFO L226 Difference]: Without dead ends: 113 [2018-12-24 14:28:50,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2018-12-24 14:28:50,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-24 14:28:50,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 51. [2018-12-24 14:28:50,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-24 14:28:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 198 transitions. [2018-12-24 14:28:50,262 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 198 transitions. Word has length 6 [2018-12-24 14:28:50,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:50,262 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 198 transitions. [2018-12-24 14:28:50,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 14:28:50,262 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 198 transitions. [2018-12-24 14:28:50,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 14:28:50,263 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:50,263 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 14:28:50,263 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:50,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:50,263 INFO L82 PathProgramCache]: Analyzing trace with hash 902478688, now seen corresponding path program 1 times [2018-12-24 14:28:50,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:50,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:50,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:50,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:50,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:50,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:28:50,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:50,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:50,341 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 14:28:50,342 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [23] [2018-12-24 14:28:50,343 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:28:50,343 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:28:51,039 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:28:51,039 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 14:28:51,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:51,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:28:51,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:51,040 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 [2018-12-24 14:28:51,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:51,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:28:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:51,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:51,082 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 [2018-12-24 14:28:51,085 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 [2018-12-24 14:28:51,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:51,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:51,093 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 [2018-12-24 14:28:51,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:51,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:51,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:51,101 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 [2018-12-24 14:28:51,101 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:51,129 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:51,141 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:51,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:51,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:51,171 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 [2018-12-24 14:28:51,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:51,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:51,223 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 [2018-12-24 14:28:51,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:51,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:51,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:51,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:51,254 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 [2018-12-24 14:28:51,255 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:51,265 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:51,274 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:51,293 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. [2018-12-24 14:28:51,293 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 14:28:51,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:51,316 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 [2018-12-24 14:28:51,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:51,335 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. [2018-12-24 14:28:51,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 14:28:51,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:51,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:51,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:51,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:51,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:51,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:51,362 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 [2018-12-24 14:28:51,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:51,384 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. [2018-12-24 14:28:51,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-12-24 14:28:51,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:51,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:51,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:51,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:51,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2018-12-24 14:28:51,458 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:51,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 14:28:51,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 14:28:51,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-24 14:28:51,458 INFO L87 Difference]: Start difference. First operand 51 states and 198 transitions. Second operand 8 states. [2018-12-24 14:28:51,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:51,730 INFO L93 Difference]: Finished difference Result 72 states and 235 transitions. [2018-12-24 14:28:51,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 14:28:51,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2018-12-24 14:28:51,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:51,732 INFO L225 Difference]: With dead ends: 72 [2018-12-24 14:28:51,732 INFO L226 Difference]: Without dead ends: 67 [2018-12-24 14:28:51,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-12-24 14:28:51,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-24 14:28:51,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2018-12-24 14:28:51,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-24 14:28:51,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 214 transitions. [2018-12-24 14:28:51,757 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 214 transitions. Word has length 6 [2018-12-24 14:28:51,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:51,758 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 214 transitions. [2018-12-24 14:28:51,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 14:28:51,758 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 214 transitions. [2018-12-24 14:28:51,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 14:28:51,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:51,759 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 14:28:51,759 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:51,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:51,759 INFO L82 PathProgramCache]: Analyzing trace with hash 902469014, now seen corresponding path program 1 times [2018-12-24 14:28:51,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:51,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:51,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:51,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:51,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:28:51,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:51,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:51,842 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 14:28:51,843 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [21] [2018-12-24 14:28:51,843 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:28:51,844 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:28:52,594 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:28:52,594 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-24 14:28:52,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:52,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:28:52,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:52,594 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 [2018-12-24 14:28:52,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:52,603 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:28:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:52,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:52,629 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 [2018-12-24 14:28:52,635 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 [2018-12-24 14:28:52,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:52,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:52,643 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 [2018-12-24 14:28:52,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:52,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:52,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:52,655 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 [2018-12-24 14:28:52,656 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:52,680 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:52,690 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:52,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:52,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:52,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, 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 [2018-12-24 14:28:52,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:52,747 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:52,748 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 [2018-12-24 14:28:52,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:52,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:52,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:52,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:52,780 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 [2018-12-24 14:28:52,781 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:52,791 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:52,800 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:52,819 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. [2018-12-24 14:28:52,819 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 14:28:52,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:52,844 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 [2018-12-24 14:28:52,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:52,862 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. [2018-12-24 14:28:52,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 14:28:52,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:52,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:52,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:52,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:52,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:52,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:52,889 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 [2018-12-24 14:28:52,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:52,911 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. [2018-12-24 14:28:52,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-12-24 14:28:52,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:52,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:52,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:52,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:52,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:52,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:52,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:52,936 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:28:52,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:52,938 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 [2018-12-24 14:28:52,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:52,961 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. [2018-12-24 14:28:52,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2018-12-24 14:28:53,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:53,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:53,086 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:53,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:53,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-24 14:28:53,106 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:53,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 14:28:53,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 14:28:53,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2018-12-24 14:28:53,107 INFO L87 Difference]: Start difference. First operand 55 states and 214 transitions. Second operand 10 states. [2018-12-24 14:28:53,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:53,547 INFO L93 Difference]: Finished difference Result 77 states and 249 transitions. [2018-12-24 14:28:53,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 14:28:53,548 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-24 14:28:53,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:53,549 INFO L225 Difference]: With dead ends: 77 [2018-12-24 14:28:53,550 INFO L226 Difference]: Without dead ends: 76 [2018-12-24 14:28:53,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2018-12-24 14:28:53,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-24 14:28:53,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2018-12-24 14:28:53,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-24 14:28:53,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 213 transitions. [2018-12-24 14:28:53,581 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 213 transitions. Word has length 6 [2018-12-24 14:28:53,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:53,581 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 213 transitions. [2018-12-24 14:28:53,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 14:28:53,581 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 213 transitions. [2018-12-24 14:28:53,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 14:28:53,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:53,582 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 14:28:53,582 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:53,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:53,582 INFO L82 PathProgramCache]: Analyzing trace with hash 902472858, now seen corresponding path program 1 times [2018-12-24 14:28:53,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:53,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:53,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:53,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:53,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:53,679 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:28:53,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:53,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:53,680 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 14:28:53,680 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [21] [2018-12-24 14:28:53,681 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:28:53,681 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:28:54,364 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:28:54,364 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-24 14:28:54,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:54,364 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:28:54,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:54,365 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 [2018-12-24 14:28:54,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:54,374 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:28:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:54,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:54,418 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 [2018-12-24 14:28:54,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, 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 [2018-12-24 14:28:54,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:54,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:54,429 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 [2018-12-24 14:28:54,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:54,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:54,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:54,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, 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 [2018-12-24 14:28:54,438 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:54,455 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:54,465 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:54,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:54,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:54,493 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 [2018-12-24 14:28:54,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:54,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:54,522 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 [2018-12-24 14:28:54,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:54,551 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:54,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:54,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:54,554 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 [2018-12-24 14:28:54,555 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:54,564 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:54,574 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:54,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:54,592 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2018-12-24 14:28:54,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:54,619 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 [2018-12-24 14:28:54,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:54,637 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. [2018-12-24 14:28:54,637 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 14:28:54,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:54,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:54,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:54,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:54,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:54,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:54,663 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 [2018-12-24 14:28:54,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:54,839 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. [2018-12-24 14:28:54,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2018-12-24 14:28:54,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:54,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:54,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:54,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:54,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:54,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:54,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:54,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:54,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:54,907 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:28:54,908 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 [2018-12-24 14:28:54,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:54,933 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. [2018-12-24 14:28:54,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2018-12-24 14:28:54,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:54,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:54,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:55,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:55,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 14:28:55,011 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:55,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 14:28:55,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 14:28:55,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-12-24 14:28:55,012 INFO L87 Difference]: Start difference. First operand 55 states and 213 transitions. Second operand 10 states. [2018-12-24 14:28:55,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:55,355 INFO L93 Difference]: Finished difference Result 78 states and 272 transitions. [2018-12-24 14:28:55,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 14:28:55,355 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-24 14:28:55,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:55,357 INFO L225 Difference]: With dead ends: 78 [2018-12-24 14:28:55,357 INFO L226 Difference]: Without dead ends: 77 [2018-12-24 14:28:55,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2018-12-24 14:28:55,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-24 14:28:55,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 59. [2018-12-24 14:28:55,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-24 14:28:55,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 238 transitions. [2018-12-24 14:28:55,391 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 238 transitions. Word has length 6 [2018-12-24 14:28:55,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:55,392 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 238 transitions. [2018-12-24 14:28:55,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 14:28:55,392 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 238 transitions. [2018-12-24 14:28:55,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 14:28:55,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:55,393 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-24 14:28:55,393 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:55,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:55,393 INFO L82 PathProgramCache]: Analyzing trace with hash 902712672, now seen corresponding path program 1 times [2018-12-24 14:28:55,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:55,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:55,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:55,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:55,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:55,449 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:28:55,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:55,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:55,450 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 14:28:55,450 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2018-12-24 14:28:55,451 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:28:55,451 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:28:56,225 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:28:56,226 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-24 14:28:56,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:56,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:28:56,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:56,226 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 [2018-12-24 14:28:56,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:56,234 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:28:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:56,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:56,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,265 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 [2018-12-24 14:28:56,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,305 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 [2018-12-24 14:28:56,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,338 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 [2018-12-24 14:28:56,339 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:56,349 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:56,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:56,373 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 [2018-12-24 14:28:56,375 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 [2018-12-24 14:28:56,377 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 [2018-12-24 14:28:56,380 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 [2018-12-24 14:28:56,380 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:56,395 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:56,404 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:56,413 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:56,431 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. [2018-12-24 14:28:56,432 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 14:28:56,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,455 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 [2018-12-24 14:28:56,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:56,474 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. [2018-12-24 14:28:56,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 14:28:56,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,501 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 [2018-12-24 14:28:56,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:56,525 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. [2018-12-24 14:28:56,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2018-12-24 14:28:56,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,551 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,556 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 [2018-12-24 14:28:56,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:56,582 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. [2018-12-24 14:28:56,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2018-12-24 14:28:56,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:56,612 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:28:56,613 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 [2018-12-24 14:28:56,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:56,635 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. [2018-12-24 14:28:56,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2018-12-24 14:28:56,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:56,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:56,704 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:56,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:56,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2018-12-24 14:28:56,724 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:56,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 14:28:56,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 14:28:56,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2018-12-24 14:28:56,725 INFO L87 Difference]: Start difference. First operand 59 states and 238 transitions. Second operand 11 states. [2018-12-24 14:28:57,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:57,229 INFO L93 Difference]: Finished difference Result 95 states and 298 transitions. [2018-12-24 14:28:57,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 14:28:57,230 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2018-12-24 14:28:57,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:57,231 INFO L225 Difference]: With dead ends: 95 [2018-12-24 14:28:57,231 INFO L226 Difference]: Without dead ends: 90 [2018-12-24 14:28:57,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2018-12-24 14:28:57,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-24 14:28:57,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2018-12-24 14:28:57,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-24 14:28:57,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 247 transitions. [2018-12-24 14:28:57,270 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 247 transitions. Word has length 6 [2018-12-24 14:28:57,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:57,270 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 247 transitions. [2018-12-24 14:28:57,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 14:28:57,270 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 247 transitions. [2018-12-24 14:28:57,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 14:28:57,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:57,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 14:28:57,271 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:57,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:57,272 INFO L82 PathProgramCache]: Analyzing trace with hash 893362642, now seen corresponding path program 1 times [2018-12-24 14:28:57,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:57,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:57,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:57,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:57,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:57,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:28:57,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:57,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:57,413 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 14:28:57,413 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [23] [2018-12-24 14:28:57,414 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:28:57,414 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:28:57,704 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:28:57,705 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 14:28:57,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:57,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:28:57,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:57,705 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 [2018-12-24 14:28:57,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:57,714 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:28:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:57,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:57,744 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 [2018-12-24 14:28:57,749 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 [2018-12-24 14:28:57,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:57,759 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:57,760 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 [2018-12-24 14:28:57,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:57,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:57,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:57,788 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 [2018-12-24 14:28:57,788 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:57,809 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:57,819 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:57,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:57,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:57,849 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 [2018-12-24 14:28:57,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:57,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:57,875 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 [2018-12-24 14:28:57,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:57,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:57,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:57,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:57,907 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 [2018-12-24 14:28:57,907 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:57,915 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:57,924 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:57,943 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. [2018-12-24 14:28:57,943 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 14:28:57,966 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:57,966 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 [2018-12-24 14:28:57,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:57,984 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. [2018-12-24 14:28:57,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 14:28:58,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:58,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:58,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:58,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:58,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:58,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:58,009 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 [2018-12-24 14:28:58,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:58,029 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. [2018-12-24 14:28:58,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2018-12-24 14:28:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:58,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:58,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:58,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:58,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2018-12-24 14:28:58,085 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:58,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-24 14:28:58,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-24 14:28:58,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-12-24 14:28:58,086 INFO L87 Difference]: Start difference. First operand 61 states and 247 transitions. Second operand 9 states. [2018-12-24 14:28:59,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:59,119 INFO L93 Difference]: Finished difference Result 90 states and 328 transitions. [2018-12-24 14:28:59,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 14:28:59,119 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2018-12-24 14:28:59,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:59,121 INFO L225 Difference]: With dead ends: 90 [2018-12-24 14:28:59,121 INFO L226 Difference]: Without dead ends: 87 [2018-12-24 14:28:59,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-12-24 14:28:59,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-24 14:28:59,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 72. [2018-12-24 14:28:59,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-24 14:28:59,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 308 transitions. [2018-12-24 14:28:59,168 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 308 transitions. Word has length 6 [2018-12-24 14:28:59,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:59,168 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 308 transitions. [2018-12-24 14:28:59,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-24 14:28:59,168 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 308 transitions. [2018-12-24 14:28:59,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 14:28:59,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:59,169 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 14:28:59,169 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:59,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:59,169 INFO L82 PathProgramCache]: Analyzing trace with hash 893472132, now seen corresponding path program 1 times [2018-12-24 14:28:59,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:59,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:59,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:59,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:59,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:59,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:28:59,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:59,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:59,244 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 14:28:59,244 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [21] [2018-12-24 14:28:59,245 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:28:59,245 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:28:59,535 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:28:59,535 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-24 14:28:59,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:59,536 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:28:59,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:59,536 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 [2018-12-24 14:28:59,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:59,547 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:28:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:59,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:59,574 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 [2018-12-24 14:28:59,580 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 [2018-12-24 14:28:59,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:59,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:59,591 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 [2018-12-24 14:28:59,603 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 [2018-12-24 14:28:59,604 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:59,618 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:59,628 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:59,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:59,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:59,656 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 [2018-12-24 14:28:59,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:59,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:59,678 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 [2018-12-24 14:28:59,679 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:59,683 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:59,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. [2018-12-24 14:28:59,696 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2018-12-24 14:28:59,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:59,725 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 [2018-12-24 14:28:59,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:59,735 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. [2018-12-24 14:28:59,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2018-12-24 14:28:59,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:59,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:59,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:59,755 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:28:59,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, 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 [2018-12-24 14:28:59,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:59,768 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. [2018-12-24 14:28:59,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2018-12-24 14:28:59,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:59,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:59,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:59,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:59,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:28:59,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, 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 [2018-12-24 14:28:59,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:59,807 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. [2018-12-24 14:28:59,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2018-12-24 14:28:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:59,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:59,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:59,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:59,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-24 14:28:59,867 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:59,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 14:28:59,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 14:28:59,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-12-24 14:28:59,868 INFO L87 Difference]: Start difference. First operand 72 states and 308 transitions. Second operand 10 states. [2018-12-24 14:29:00,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:00,206 INFO L93 Difference]: Finished difference Result 122 states and 469 transitions. [2018-12-24 14:29:00,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 14:29:00,207 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-24 14:29:00,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:00,209 INFO L225 Difference]: With dead ends: 122 [2018-12-24 14:29:00,209 INFO L226 Difference]: Without dead ends: 121 [2018-12-24 14:29:00,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-12-24 14:29:00,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-24 14:29:00,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2018-12-24 14:29:00,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-24 14:29:00,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 434 transitions. [2018-12-24 14:29:00,268 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 434 transitions. Word has length 6 [2018-12-24 14:29:00,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:00,268 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 434 transitions. [2018-12-24 14:29:00,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 14:29:00,269 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 434 transitions. [2018-12-24 14:29:00,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 14:29:00,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:00,269 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 14:29:00,270 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:00,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:00,270 INFO L82 PathProgramCache]: Analyzing trace with hash 897235472, now seen corresponding path program 1 times [2018-12-24 14:29:00,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:00,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:00,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:00,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:00,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:00,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:29:00,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:00,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:00,430 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 14:29:00,430 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [23] [2018-12-24 14:29:00,430 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:29:00,431 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:29:00,970 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:29:00,970 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 14:29:00,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:00,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:29:00,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:00,971 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 [2018-12-24 14:29:00,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:00,979 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:29:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:00,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:00,996 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 [2018-12-24 14:29:01,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:01,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:01,014 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 [2018-12-24 14:29:01,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:01,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:01,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:01,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:01,061 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 [2018-12-24 14:29:01,062 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:01,070 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:01,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:01,093 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 [2018-12-24 14:29:01,096 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 [2018-12-24 14:29:01,099 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 [2018-12-24 14:29:01,102 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 [2018-12-24 14:29:01,103 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:01,119 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:01,128 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:01,136 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:01,153 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. [2018-12-24 14:29:01,153 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2018-12-24 14:29:01,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:01,185 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 [2018-12-24 14:29:01,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:01,198 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. [2018-12-24 14:29:01,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2018-12-24 14:29:01,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:01,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:01,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:01,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:01,217 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:29:01,218 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 [2018-12-24 14:29:01,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:01,231 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. [2018-12-24 14:29:01,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2018-12-24 14:29:01,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:01,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:01,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:01,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:01,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 14:29:01,287 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:01,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 14:29:01,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 14:29:01,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-24 14:29:01,288 INFO L87 Difference]: Start difference. First operand 96 states and 434 transitions. Second operand 8 states. [2018-12-24 14:29:01,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:01,520 INFO L93 Difference]: Finished difference Result 113 states and 457 transitions. [2018-12-24 14:29:01,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 14:29:01,521 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2018-12-24 14:29:01,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:01,522 INFO L225 Difference]: With dead ends: 113 [2018-12-24 14:29:01,522 INFO L226 Difference]: Without dead ends: 108 [2018-12-24 14:29:01,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-12-24 14:29:01,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-24 14:29:01,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2018-12-24 14:29:01,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-24 14:29:01,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 438 transitions. [2018-12-24 14:29:01,589 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 438 transitions. Word has length 6 [2018-12-24 14:29:01,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:01,589 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 438 transitions. [2018-12-24 14:29:01,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 14:29:01,589 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 438 transitions. [2018-12-24 14:29:01,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 14:29:01,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:01,590 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 14:29:01,590 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:01,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:01,590 INFO L82 PathProgramCache]: Analyzing trace with hash 896931732, now seen corresponding path program 2 times [2018-12-24 14:29:01,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:01,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:01,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:01,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:01,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:01,738 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-12-24 14:29:01,754 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:29:01,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:01,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:01,755 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:29:01,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:29:01,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:01,755 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 [2018-12-24 14:29:01,764 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:29:01,764 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:29:01,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 14:29:01,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:29:01,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:01,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:01,787 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 [2018-12-24 14:29:01,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:01,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:01,812 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 [2018-12-24 14:29:01,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:01,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:01,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:01,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:01,847 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 [2018-12-24 14:29:01,847 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:01,858 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:01,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:01,883 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 [2018-12-24 14:29:01,886 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 [2018-12-24 14:29:01,889 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 [2018-12-24 14:29:01,892 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 [2018-12-24 14:29:01,892 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:01,908 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:02,004 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:02,011 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:02,030 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. [2018-12-24 14:29:02,031 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 14:29:02,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:02,057 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 [2018-12-24 14:29:02,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:02,076 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. [2018-12-24 14:29:02,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 14:29:02,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:02,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:02,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:02,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:02,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:02,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:02,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, 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 [2018-12-24 14:29:02,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:02,125 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. [2018-12-24 14:29:02,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2018-12-24 14:29:02,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:02,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:02,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:02,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:02,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:02,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:02,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:02,149 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:29:02,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:02,151 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 [2018-12-24 14:29:02,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:02,176 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. [2018-12-24 14:29:02,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2018-12-24 14:29:02,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:02,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:02,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:02,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:02,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2018-12-24 14:29:02,250 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:02,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-24 14:29:02,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-24 14:29:02,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-12-24 14:29:02,251 INFO L87 Difference]: Start difference. First operand 97 states and 438 transitions. Second operand 9 states. [2018-12-24 14:29:02,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:02,637 INFO L93 Difference]: Finished difference Result 137 states and 550 transitions. [2018-12-24 14:29:02,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 14:29:02,638 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2018-12-24 14:29:02,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:02,640 INFO L225 Difference]: With dead ends: 137 [2018-12-24 14:29:02,640 INFO L226 Difference]: Without dead ends: 136 [2018-12-24 14:29:02,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-12-24 14:29:02,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-24 14:29:02,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2018-12-24 14:29:02,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-24 14:29:02,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 421 transitions. [2018-12-24 14:29:02,695 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 421 transitions. Word has length 6 [2018-12-24 14:29:02,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:02,695 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 421 transitions. [2018-12-24 14:29:02,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-24 14:29:02,696 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 421 transitions. [2018-12-24 14:29:02,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 14:29:02,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:02,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 14:29:02,697 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:02,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:02,697 INFO L82 PathProgramCache]: Analyzing trace with hash 900929556, now seen corresponding path program 1 times [2018-12-24 14:29:02,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:02,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:02,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:29:02,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:02,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:02,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:02,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:02,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:02,981 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 14:29:02,982 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [23] [2018-12-24 14:29:02,982 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:29:02,983 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:29:03,704 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:29:03,704 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 14:29:03,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:03,704 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:29:03,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:03,705 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 [2018-12-24 14:29:03,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:03,713 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:29:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:03,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:03,724 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 [2018-12-24 14:29:03,728 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 [2018-12-24 14:29:03,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:03,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:03,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:03,755 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 [2018-12-24 14:29:03,756 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:03,767 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:03,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:03,788 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 [2018-12-24 14:29:03,790 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 [2018-12-24 14:29:03,798 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 [2018-12-24 14:29:03,804 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 [2018-12-24 14:29:03,805 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:03,816 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:03,824 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:03,832 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:03,845 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. [2018-12-24 14:29:03,846 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:30, output treesize:33 [2018-12-24 14:29:03,928 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:03,929 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 [2018-12-24 14:29:03,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:03,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:03,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2018-12-24 14:29:03,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:03,989 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:03,989 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:03,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:03,991 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 [2018-12-24 14:29:03,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:04,000 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. [2018-12-24 14:29:04,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-12-24 14:29:04,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:04,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:04,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:04,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:04,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 14:29:04,050 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:04,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 14:29:04,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 14:29:04,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-24 14:29:04,051 INFO L87 Difference]: Start difference. First operand 93 states and 421 transitions. Second operand 8 states. [2018-12-24 14:29:04,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:04,263 INFO L93 Difference]: Finished difference Result 110 states and 439 transitions. [2018-12-24 14:29:04,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 14:29:04,263 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2018-12-24 14:29:04,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:04,265 INFO L225 Difference]: With dead ends: 110 [2018-12-24 14:29:04,265 INFO L226 Difference]: Without dead ends: 109 [2018-12-24 14:29:04,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-12-24 14:29:04,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-24 14:29:04,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2018-12-24 14:29:04,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-24 14:29:04,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 406 transitions. [2018-12-24 14:29:04,321 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 406 transitions. Word has length 6 [2018-12-24 14:29:04,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:04,321 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 406 transitions. [2018-12-24 14:29:04,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 14:29:04,321 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 406 transitions. [2018-12-24 14:29:04,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 14:29:04,322 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:04,322 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-24 14:29:04,322 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:04,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:04,322 INFO L82 PathProgramCache]: Analyzing trace with hash 900915912, now seen corresponding path program 2 times [2018-12-24 14:29:04,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:04,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:04,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:04,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:04,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:04,868 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:29:04,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:04,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:04,869 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:29:04,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:29:04,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:04,869 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 [2018-12-24 14:29:04,890 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:29:04,890 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:29:04,936 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 14:29:04,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:29:04,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:05,085 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-12-24 14:29:05,105 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 [2018-12-24 14:29:05,116 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 [2018-12-24 14:29:05,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,172 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 [2018-12-24 14:29:05,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,201 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 [2018-12-24 14:29:05,201 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:05,218 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:05,228 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:05,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:05,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,259 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 [2018-12-24 14:29:05,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,287 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 [2018-12-24 14:29:05,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,321 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 [2018-12-24 14:29:05,321 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:05,330 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:05,339 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:05,358 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. [2018-12-24 14:29:05,359 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 14:29:05,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,381 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 [2018-12-24 14:29:05,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:05,400 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. [2018-12-24 14:29:05,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 14:29:05,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,425 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,427 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 [2018-12-24 14:29:05,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:05,449 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. [2018-12-24 14:29:05,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2018-12-24 14:29:05,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,473 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,476 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,477 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,477 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:29:05,478 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 [2018-12-24 14:29:05,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:05,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. [2018-12-24 14:29:05,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2018-12-24 14:29:05,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:05,530 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 [2018-12-24 14:29:05,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:05,557 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. [2018-12-24 14:29:05,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2018-12-24 14:29:05,575 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:05,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:05,619 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:05,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:05,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2018-12-24 14:29:05,639 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:05,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 14:29:05,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 14:29:05,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2018-12-24 14:29:05,640 INFO L87 Difference]: Start difference. First operand 90 states and 406 transitions. Second operand 11 states. [2018-12-24 14:29:06,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:06,085 INFO L93 Difference]: Finished difference Result 124 states and 476 transitions. [2018-12-24 14:29:06,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 14:29:06,086 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2018-12-24 14:29:06,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:06,088 INFO L225 Difference]: With dead ends: 124 [2018-12-24 14:29:06,088 INFO L226 Difference]: Without dead ends: 116 [2018-12-24 14:29:06,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2018-12-24 14:29:06,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-24 14:29:06,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2018-12-24 14:29:06,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-24 14:29:06,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 435 transitions. [2018-12-24 14:29:06,140 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 435 transitions. Word has length 6 [2018-12-24 14:29:06,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:06,140 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 435 transitions. [2018-12-24 14:29:06,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 14:29:06,141 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 435 transitions. [2018-12-24 14:29:06,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 14:29:06,141 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:06,141 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 14:29:06,141 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:06,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:06,142 INFO L82 PathProgramCache]: Analyzing trace with hash 900919446, now seen corresponding path program 1 times [2018-12-24 14:29:06,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:06,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:06,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:29:06,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:06,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:06,213 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:06,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:06,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:06,214 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 14:29:06,214 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2018-12-24 14:29:06,216 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:29:06,216 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:29:07,029 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:29:07,029 INFO L272 AbstractInterpreter]: Visited 6 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-24 14:29:07,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:07,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:29:07,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:07,030 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 [2018-12-24 14:29:07,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:07,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:29:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:07,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:07,064 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 [2018-12-24 14:29:07,067 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 [2018-12-24 14:29:07,080 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,082 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 [2018-12-24 14:29:07,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,097 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 [2018-12-24 14:29:07,098 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:07,126 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:07,137 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:07,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:07,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,166 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 [2018-12-24 14:29:07,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,195 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 [2018-12-24 14:29:07,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,255 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 [2018-12-24 14:29:07,256 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:07,266 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:07,275 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:07,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:07,295 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2018-12-24 14:29:07,322 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,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 51 [2018-12-24 14:29:07,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:07,344 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. [2018-12-24 14:29:07,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 14:29:07,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,374 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 [2018-12-24 14:29:07,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:07,395 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. [2018-12-24 14:29:07,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2018-12-24 14:29:07,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,425 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,430 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:29:07,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,432 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 [2018-12-24 14:29:07,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:07,461 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. [2018-12-24 14:29:07,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2018-12-24 14:29:07,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,488 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:07,498 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:29:07,499 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 [2018-12-24 14:29:07,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:07,535 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. [2018-12-24 14:29:07,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2018-12-24 14:29:07,557 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:07,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:07,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:07,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:07,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2018-12-24 14:29:07,630 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:07,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 14:29:07,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 14:29:07,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2018-12-24 14:29:07,631 INFO L87 Difference]: Start difference. First operand 97 states and 435 transitions. Second operand 12 states. [2018-12-24 14:29:08,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:08,247 INFO L93 Difference]: Finished difference Result 137 states and 564 transitions. [2018-12-24 14:29:08,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 14:29:08,247 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2018-12-24 14:29:08,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:08,249 INFO L225 Difference]: With dead ends: 137 [2018-12-24 14:29:08,249 INFO L226 Difference]: Without dead ends: 136 [2018-12-24 14:29:08,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2018-12-24 14:29:08,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-24 14:29:08,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2018-12-24 14:29:08,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-24 14:29:08,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 465 transitions. [2018-12-24 14:29:08,304 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 465 transitions. Word has length 6 [2018-12-24 14:29:08,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:08,304 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 465 transitions. [2018-12-24 14:29:08,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 14:29:08,305 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 465 transitions. [2018-12-24 14:29:08,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 14:29:08,305 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:08,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 14:29:08,306 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:08,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:08,306 INFO L82 PathProgramCache]: Analyzing trace with hash 900627426, now seen corresponding path program 2 times [2018-12-24 14:29:08,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:08,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:08,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:08,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:08,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:08,536 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-24 14:29:08,622 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:08,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:08,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:08,623 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:29:08,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:29:08,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:08,623 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 [2018-12-24 14:29:08,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:29:08,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:29:08,640 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 14:29:08,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:29:08,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:08,660 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 [2018-12-24 14:29:08,663 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 [2018-12-24 14:29:08,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:08,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:08,668 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 [2018-12-24 14:29:08,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:08,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:08,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:08,673 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 [2018-12-24 14:29:08,674 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:08,692 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:08,702 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:08,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:08,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:08,732 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 [2018-12-24 14:29:08,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:08,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:08,809 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 [2018-12-24 14:29:08,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:08,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:08,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:08,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:08,840 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 [2018-12-24 14:29:08,841 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:08,851 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:08,858 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:08,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:08,877 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2018-12-24 14:29:08,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:08,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 51 [2018-12-24 14:29:08,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:08,930 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. [2018-12-24 14:29:08,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 14:29:08,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:08,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:08,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:08,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:08,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:08,957 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:29:08,958 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 [2018-12-24 14:29:08,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:09,021 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. [2018-12-24 14:29:09,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2018-12-24 14:29:09,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:09,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:09,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:09,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:09,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:09,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:09,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:09,047 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 [2018-12-24 14:29:09,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:09,066 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. [2018-12-24 14:29:09,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2018-12-24 14:29:09,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:09,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:09,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:09,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:09,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:09,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:09,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:09,095 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:29:09,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:09,097 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 [2018-12-24 14:29:09,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:09,122 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. [2018-12-24 14:29:09,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2018-12-24 14:29:09,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:09,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:09,193 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:09,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:09,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2018-12-24 14:29:09,213 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:09,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 14:29:09,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 14:29:09,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-12-24 14:29:09,214 INFO L87 Difference]: Start difference. First operand 103 states and 465 transitions. Second operand 12 states. [2018-12-24 14:29:09,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:09,861 INFO L93 Difference]: Finished difference Result 172 states and 721 transitions. [2018-12-24 14:29:09,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 14:29:09,862 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2018-12-24 14:29:09,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:09,864 INFO L225 Difference]: With dead ends: 172 [2018-12-24 14:29:09,864 INFO L226 Difference]: Without dead ends: 167 [2018-12-24 14:29:09,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2018-12-24 14:29:09,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-24 14:29:09,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 116. [2018-12-24 14:29:09,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-24 14:29:09,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 529 transitions. [2018-12-24 14:29:09,928 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 529 transitions. Word has length 6 [2018-12-24 14:29:09,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:09,928 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 529 transitions. [2018-12-24 14:29:09,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 14:29:09,928 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 529 transitions. [2018-12-24 14:29:09,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 14:29:09,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:09,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 14:29:09,929 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:09,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:09,929 INFO L82 PathProgramCache]: Analyzing trace with hash 900621846, now seen corresponding path program 3 times [2018-12-24 14:29:09,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:09,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:09,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:29:09,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:09,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:10,111 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:10,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:10,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:10,112 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:29:10,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:29:10,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:10,113 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 [2018-12-24 14:29:10,122 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:29:10,122 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:29:10,126 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:29:10,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:29:10,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:10,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,144 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 [2018-12-24 14:29:10,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,171 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 [2018-12-24 14:29:10,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,203 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 [2018-12-24 14:29:10,204 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:10,214 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:10,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:10,239 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 [2018-12-24 14:29:10,242 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 [2018-12-24 14:29:10,245 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 [2018-12-24 14:29:10,249 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 [2018-12-24 14:29:10,249 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:10,265 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:10,274 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:10,283 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:10,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:10,302 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2018-12-24 14:29:10,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,330 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 [2018-12-24 14:29:10,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:10,348 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. [2018-12-24 14:29:10,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 14:29:10,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,376 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:29:10,377 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 [2018-12-24 14:29:10,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:10,398 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. [2018-12-24 14:29:10,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2018-12-24 14:29:10,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,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, 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 [2018-12-24 14:29:10,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:10,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. [2018-12-24 14:29:10,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2018-12-24 14:29:10,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,473 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:10,475 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:29:10,476 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 [2018-12-24 14:29:10,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:10,502 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. [2018-12-24 14:29:10,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:31 [2018-12-24 14:29:10,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:10,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:10,586 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:10,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:10,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-24 14:29:10,605 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:10,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 14:29:10,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 14:29:10,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-12-24 14:29:10,605 INFO L87 Difference]: Start difference. First operand 116 states and 529 transitions. Second operand 12 states. [2018-12-24 14:29:11,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:11,075 INFO L93 Difference]: Finished difference Result 140 states and 566 transitions. [2018-12-24 14:29:11,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 14:29:11,076 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2018-12-24 14:29:11,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:11,078 INFO L225 Difference]: With dead ends: 140 [2018-12-24 14:29:11,078 INFO L226 Difference]: Without dead ends: 135 [2018-12-24 14:29:11,079 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 [2018-12-24 14:29:11,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-24 14:29:11,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 46. [2018-12-24 14:29:11,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-24 14:29:11,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 176 transitions. [2018-12-24 14:29:11,141 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 176 transitions. Word has length 6 [2018-12-24 14:29:11,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:11,141 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 176 transitions. [2018-12-24 14:29:11,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 14:29:11,142 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 176 transitions. [2018-12-24 14:29:11,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 14:29:11,142 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:11,142 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 14:29:11,143 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:11,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:11,143 INFO L82 PathProgramCache]: Analyzing trace with hash -2088231584, now seen corresponding path program 1 times [2018-12-24 14:29:11,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:11,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:11,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:29:11,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:11,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:11,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:29:11,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:11,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:11,295 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 14:29:11,295 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [23] [2018-12-24 14:29:11,297 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:29:11,297 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:29:12,008 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:29:12,008 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-24 14:29:12,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:12,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:29:12,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:12,009 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 [2018-12-24 14:29:12,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:12,017 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:29:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:12,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:12,041 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 [2018-12-24 14:29:12,044 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 [2018-12-24 14:29:12,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:12,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:12,055 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 [2018-12-24 14:29:12,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:12,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:12,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:12,072 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 [2018-12-24 14:29:12,073 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:12,101 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:12,110 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:12,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:12,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:12,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 31 treesize of output 40 [2018-12-24 14:29:12,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:12,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:12,166 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 [2018-12-24 14:29:12,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:12,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:12,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:12,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:12,201 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 [2018-12-24 14:29:12,201 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:12,210 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:12,219 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:12,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:12,239 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2018-12-24 14:29:12,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:12,266 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 [2018-12-24 14:29:12,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:12,285 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. [2018-12-24 14:29:12,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 14:29:12,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:12,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:12,311 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:12,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:12,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:12,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:12,315 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 [2018-12-24 14:29:12,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:12,337 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. [2018-12-24 14:29:12,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2018-12-24 14:29:12,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:12,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:12,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:12,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:12,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:12,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:12,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:12,366 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:29:12,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:12,368 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 [2018-12-24 14:29:12,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:12,393 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. [2018-12-24 14:29:12,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2018-12-24 14:29:12,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:12,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:12,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:12,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:12,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-24 14:29:12,467 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:12,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 14:29:12,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 14:29:12,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-24 14:29:12,467 INFO L87 Difference]: Start difference. First operand 46 states and 176 transitions. Second operand 10 states. [2018-12-24 14:29:12,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:12,939 INFO L93 Difference]: Finished difference Result 77 states and 262 transitions. [2018-12-24 14:29:12,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 14:29:12,940 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2018-12-24 14:29:12,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:12,941 INFO L225 Difference]: With dead ends: 77 [2018-12-24 14:29:12,941 INFO L226 Difference]: Without dead ends: 76 [2018-12-24 14:29:12,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2018-12-24 14:29:12,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-24 14:29:13,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2018-12-24 14:29:13,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-24 14:29:13,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 213 transitions. [2018-12-24 14:29:13,031 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 213 transitions. Word has length 7 [2018-12-24 14:29:13,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:13,031 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 213 transitions. [2018-12-24 14:29:13,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 14:29:13,031 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 213 transitions. [2018-12-24 14:29:13,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 14:29:13,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:13,032 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 14:29:13,032 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:13,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:13,033 INFO L82 PathProgramCache]: Analyzing trace with hash -2088122094, now seen corresponding path program 1 times [2018-12-24 14:29:13,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:13,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:13,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:13,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:13,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:13,142 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:29:13,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:13,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:13,142 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 14:29:13,142 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [21] [2018-12-24 14:29:13,144 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:29:13,144 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:29:14,083 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:29:14,083 INFO L272 AbstractInterpreter]: Visited 7 different actions 17 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-24 14:29:14,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:14,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:29:14,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:14,084 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 [2018-12-24 14:29:14,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:14,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:29:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:14,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:14,126 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 [2018-12-24 14:29:14,131 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 [2018-12-24 14:29:14,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,147 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 [2018-12-24 14:29:14,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,154 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 [2018-12-24 14:29:14,154 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:14,169 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:14,185 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:14,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:14,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,212 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 [2018-12-24 14:29:14,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,241 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 [2018-12-24 14:29:14,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,272 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 [2018-12-24 14:29:14,272 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:14,282 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:14,291 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:14,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:14,310 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2018-12-24 14:29:14,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,335 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 [2018-12-24 14:29:14,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:14,353 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. [2018-12-24 14:29:14,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 14:29:14,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,379 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 [2018-12-24 14:29:14,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:14,401 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. [2018-12-24 14:29:14,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2018-12-24 14:29:14,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,434 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:29:14,434 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 [2018-12-24 14:29:14,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:14,457 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. [2018-12-24 14:29:14,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2018-12-24 14:29:14,477 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,485 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:29:14,486 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:14,486 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 [2018-12-24 14:29:14,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:14,509 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. [2018-12-24 14:29:14,509 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2018-12-24 14:29:14,528 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:14,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:14,571 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:14,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:14,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2018-12-24 14:29:14,591 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:14,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 14:29:14,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 14:29:14,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2018-12-24 14:29:14,592 INFO L87 Difference]: Start difference. First operand 54 states and 213 transitions. Second operand 12 states. [2018-12-24 14:29:15,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:15,149 INFO L93 Difference]: Finished difference Result 86 states and 270 transitions. [2018-12-24 14:29:15,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 14:29:15,150 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2018-12-24 14:29:15,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:15,151 INFO L225 Difference]: With dead ends: 86 [2018-12-24 14:29:15,152 INFO L226 Difference]: Without dead ends: 85 [2018-12-24 14:29:15,152 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 [2018-12-24 14:29:15,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-24 14:29:15,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 53. [2018-12-24 14:29:15,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-24 14:29:15,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 208 transitions. [2018-12-24 14:29:15,217 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 208 transitions. Word has length 7 [2018-12-24 14:29:15,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:15,217 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 208 transitions. [2018-12-24 14:29:15,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 14:29:15,218 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 208 transitions. [2018-12-24 14:29:15,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 14:29:15,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:15,218 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 14:29:15,218 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:15,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:15,218 INFO L82 PathProgramCache]: Analyzing trace with hash -2084237604, now seen corresponding path program 1 times [2018-12-24 14:29:15,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:15,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:15,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:15,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:15,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:15,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:15,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:15,417 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 14:29:15,417 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [24], [25] [2018-12-24 14:29:15,420 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:29:15,420 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:29:16,128 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:29:16,128 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 14:29:16,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:16,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:29:16,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:16,129 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 [2018-12-24 14:29:16,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:16,146 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:29:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:16,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:16,183 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 [2018-12-24 14:29:16,220 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 [2018-12-24 14:29:16,298 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 [2018-12-24 14:29:16,349 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 [2018-12-24 14:29:16,350 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:16,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:16,363 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:16,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:16,378 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. [2018-12-24 14:29:16,379 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:15, output treesize:21 [2018-12-24 14:29:16,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:16,406 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 [2018-12-24 14:29:16,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-24 14:29:16,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-24 14:29:16,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:21 [2018-12-24 14:29:16,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:16,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, 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 [2018-12-24 14:29:16,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:16,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:16,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:16,446 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:29:16,447 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 [2018-12-24 14:29:16,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:16,458 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. [2018-12-24 14:29:16,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:21 [2018-12-24 14:29:16,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:16,475 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:16,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:16,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-24 14:29:16,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 9 [2018-12-24 14:29:16,510 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 14:29:16,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-24 14:29:16,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-24 14:29:16,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-24 14:29:16,511 INFO L87 Difference]: Start difference. First operand 53 states and 208 transitions. Second operand 5 states. [2018-12-24 14:29:16,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:16,748 INFO L93 Difference]: Finished difference Result 115 states and 427 transitions. [2018-12-24 14:29:16,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 14:29:16,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-12-24 14:29:16,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:16,751 INFO L225 Difference]: With dead ends: 115 [2018-12-24 14:29:16,751 INFO L226 Difference]: Without dead ends: 110 [2018-12-24 14:29:16,751 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 [2018-12-24 14:29:16,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-24 14:29:16,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2018-12-24 14:29:16,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-24 14:29:16,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 343 transitions. [2018-12-24 14:29:16,883 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 343 transitions. Word has length 7 [2018-12-24 14:29:16,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:16,883 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 343 transitions. [2018-12-24 14:29:16,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-24 14:29:16,884 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 343 transitions. [2018-12-24 14:29:16,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 14:29:16,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:16,884 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 14:29:16,884 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:16,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:16,885 INFO L82 PathProgramCache]: Analyzing trace with hash -2084662494, now seen corresponding path program 2 times [2018-12-24 14:29:16,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:16,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:16,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:16,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:16,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:17,037 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:29:17,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:17,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:17,038 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:29:17,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:29:17,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:17,039 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 [2018-12-24 14:29:17,050 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:29:17,050 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:29:17,058 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 14:29:17,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:29:17,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:17,072 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 [2018-12-24 14:29:17,075 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 [2018-12-24 14:29:17,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,080 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 [2018-12-24 14:29:17,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,086 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 [2018-12-24 14:29:17,086 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:17,104 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:17,114 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:17,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:17,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,144 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 [2018-12-24 14:29:17,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,172 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 [2018-12-24 14:29:17,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,206 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 [2018-12-24 14:29:17,207 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:17,216 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:17,226 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:17,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:17,244 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2018-12-24 14:29:17,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,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, 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 [2018-12-24 14:29:17,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:17,290 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. [2018-12-24 14:29:17,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 14:29:17,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,317 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:29:17,318 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 [2018-12-24 14:29:17,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:17,339 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. [2018-12-24 14:29:17,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2018-12-24 14:29:17,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,368 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 [2018-12-24 14:29:17,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:17,390 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. [2018-12-24 14:29:17,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2018-12-24 14:29:17,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:17,416 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:29:17,417 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 [2018-12-24 14:29:17,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:17,444 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. [2018-12-24 14:29:17,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2018-12-24 14:29:17,479 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:17,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:17,528 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:17,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:17,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2018-12-24 14:29:17,549 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:17,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 14:29:17,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 14:29:17,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2018-12-24 14:29:17,550 INFO L87 Difference]: Start difference. First operand 84 states and 343 transitions. Second operand 11 states. [2018-12-24 14:29:18,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:18,160 INFO L93 Difference]: Finished difference Result 104 states and 372 transitions. [2018-12-24 14:29:18,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 14:29:18,161 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2018-12-24 14:29:18,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:18,162 INFO L225 Difference]: With dead ends: 104 [2018-12-24 14:29:18,163 INFO L226 Difference]: Without dead ends: 103 [2018-12-24 14:29:18,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2018-12-24 14:29:18,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-24 14:29:18,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 47. [2018-12-24 14:29:18,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-24 14:29:18,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 177 transitions. [2018-12-24 14:29:18,296 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 177 transitions. Word has length 7 [2018-12-24 14:29:18,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:18,296 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 177 transitions. [2018-12-24 14:29:18,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 14:29:18,296 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 177 transitions. [2018-12-24 14:29:18,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 14:29:18,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:18,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 14:29:18,297 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:18,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:18,297 INFO L82 PathProgramCache]: Analyzing trace with hash -2080843416, now seen corresponding path program 1 times [2018-12-24 14:29:18,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:18,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:18,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:29:18,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:18,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:18,433 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-24 14:29:18,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:18,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:18,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:18,629 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 14:29:18,630 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [22], [23] [2018-12-24 14:29:18,636 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:29:18,636 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:29:19,338 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:29:19,338 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-24 14:29:19,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:19,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:29:19,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:19,339 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 [2018-12-24 14:29:19,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:19,347 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:29:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:19,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:19,361 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 [2018-12-24 14:29:19,363 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 [2018-12-24 14:29:19,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:19,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:19,378 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 [2018-12-24 14:29:19,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:19,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:19,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:19,390 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 [2018-12-24 14:29:19,391 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:19,412 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:19,422 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:19,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:19,472 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 [2018-12-24 14:29:19,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:19,486 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:19,487 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 [2018-12-24 14:29:19,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:19,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:19,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:19,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:19,517 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 [2018-12-24 14:29:19,518 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:19,526 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:19,534 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:19,551 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. [2018-12-24 14:29:19,551 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2018-12-24 14:29:19,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:19,584 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 [2018-12-24 14:29:19,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:19,594 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. [2018-12-24 14:29:19,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2018-12-24 14:29:19,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:19,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:19,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:19,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:19,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:19,615 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 [2018-12-24 14:29:19,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:19,630 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. [2018-12-24 14:29:19,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2018-12-24 14:29:19,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:19,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:19,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:19,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:19,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:19,649 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:29:19,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:19,651 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 [2018-12-24 14:29:19,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:19,667 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. [2018-12-24 14:29:19,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:20 [2018-12-24 14:29:19,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:19,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:19,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:19,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:19,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 14:29:19,741 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:19,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 14:29:19,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 14:29:19,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-12-24 14:29:19,742 INFO L87 Difference]: Start difference. First operand 47 states and 177 transitions. Second operand 10 states. [2018-12-24 14:29:20,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:20,146 INFO L93 Difference]: Finished difference Result 68 states and 235 transitions. [2018-12-24 14:29:20,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 14:29:20,147 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2018-12-24 14:29:20,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:20,148 INFO L225 Difference]: With dead ends: 68 [2018-12-24 14:29:20,148 INFO L226 Difference]: Without dead ends: 67 [2018-12-24 14:29:20,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2018-12-24 14:29:20,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-24 14:29:20,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2018-12-24 14:29:20,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-24 14:29:20,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 190 transitions. [2018-12-24 14:29:20,266 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 190 transitions. Word has length 7 [2018-12-24 14:29:20,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:20,266 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 190 transitions. [2018-12-24 14:29:20,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 14:29:20,266 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 190 transitions. [2018-12-24 14:29:20,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 14:29:20,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:20,266 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-12-24 14:29:20,267 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:20,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:20,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1920744098, now seen corresponding path program 1 times [2018-12-24 14:29:20,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:20,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:20,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:20,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:20,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:20,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-24 14:29:20,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 14:29:20,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-24 14:29:20,335 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 14:29:20,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 14:29:20,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 14:29:20,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-24 14:29:20,336 INFO L87 Difference]: Start difference. First operand 50 states and 190 transitions. Second operand 4 states. [2018-12-24 14:29:20,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:20,468 INFO L93 Difference]: Finished difference Result 54 states and 193 transitions. [2018-12-24 14:29:20,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 14:29:20,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-12-24 14:29:20,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:20,469 INFO L225 Difference]: With dead ends: 54 [2018-12-24 14:29:20,470 INFO L226 Difference]: Without dead ends: 50 [2018-12-24 14:29:20,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-24 14:29:20,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-24 14:29:20,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-24 14:29:20,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-24 14:29:20,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 189 transitions. [2018-12-24 14:29:20,572 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 189 transitions. Word has length 7 [2018-12-24 14:29:20,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:20,572 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 189 transitions. [2018-12-24 14:29:20,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 14:29:20,572 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 189 transitions. [2018-12-24 14:29:20,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 14:29:20,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:20,573 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 14:29:20,573 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:20,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:20,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1928011116, now seen corresponding path program 1 times [2018-12-24 14:29:20,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:20,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:20,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:20,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:20,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:20,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:29:20,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:20,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:20,745 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 14:29:20,746 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [23] [2018-12-24 14:29:20,747 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:29:20,747 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:29:21,420 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:29:21,420 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-24 14:29:21,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:21,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:29:21,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:21,421 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 [2018-12-24 14:29:21,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:21,430 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:29:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:21,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:21,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:21,465 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 [2018-12-24 14:29:21,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:21,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:21,503 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 [2018-12-24 14:29:21,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:21,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:21,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:21,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:21,536 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 [2018-12-24 14:29:21,537 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:21,548 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:21,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:21,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, 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 [2018-12-24 14:29:21,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, 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 [2018-12-24 14:29:21,582 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 [2018-12-24 14:29:21,600 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 [2018-12-24 14:29:21,601 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:21,689 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:21,699 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:21,707 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:21,726 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. [2018-12-24 14:29:21,726 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 14:29:21,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:21,788 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 [2018-12-24 14:29:21,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:21,840 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. [2018-12-24 14:29:21,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 14:29:21,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:21,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:21,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:21,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:21,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:21,866 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:29:21,867 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 [2018-12-24 14:29:21,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:21,889 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. [2018-12-24 14:29:21,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2018-12-24 14:29:21,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:21,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:21,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:21,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:21,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:21,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:21,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:21,913 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 [2018-12-24 14:29:21,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:21,935 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. [2018-12-24 14:29:21,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2018-12-24 14:29:21,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:21,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:21,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:22,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:22,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-24 14:29:22,001 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:22,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 14:29:22,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 14:29:22,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-12-24 14:29:22,002 INFO L87 Difference]: Start difference. First operand 50 states and 189 transitions. Second operand 10 states. [2018-12-24 14:29:22,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:22,412 INFO L93 Difference]: Finished difference Result 78 states and 242 transitions. [2018-12-24 14:29:22,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 14:29:22,413 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2018-12-24 14:29:22,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:22,414 INFO L225 Difference]: With dead ends: 78 [2018-12-24 14:29:22,414 INFO L226 Difference]: Without dead ends: 71 [2018-12-24 14:29:22,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2018-12-24 14:29:22,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-24 14:29:22,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2018-12-24 14:29:22,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-24 14:29:22,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 193 transitions. [2018-12-24 14:29:22,542 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 193 transitions. Word has length 7 [2018-12-24 14:29:22,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:22,542 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 193 transitions. [2018-12-24 14:29:22,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 14:29:22,542 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 193 transitions. [2018-12-24 14:29:22,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 14:29:22,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:22,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 14:29:22,543 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:22,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:22,543 INFO L82 PathProgramCache]: Analyzing trace with hash 2035260702, now seen corresponding path program 1 times [2018-12-24 14:29:22,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:22,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:22,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:22,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:22,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:22,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:29:22,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:22,681 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:22,681 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 14:29:22,682 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [24], [25] [2018-12-24 14:29:22,683 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:29:22,683 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:29:22,890 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:29:22,890 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 14:29:22,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:22,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:29:22,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:22,891 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 [2018-12-24 14:29:22,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:22,900 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:29:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:22,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:22,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:22,929 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 [2018-12-24 14:29:22,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:22,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:22,967 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 [2018-12-24 14:29:23,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:23,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:23,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:23,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:23,008 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 [2018-12-24 14:29:23,008 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:23,018 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:23,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:23,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, 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 [2018-12-24 14:29:23,046 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 [2018-12-24 14:29:23,048 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 [2018-12-24 14:29:23,051 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 [2018-12-24 14:29:23,051 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:23,065 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:23,075 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:23,083 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:23,102 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. [2018-12-24 14:29:23,102 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 14:29:23,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:23,126 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 [2018-12-24 14:29:23,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:23,147 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. [2018-12-24 14:29:23,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 14:29:23,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:23,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:23,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:23,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:23,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:23,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:23,175 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 [2018-12-24 14:29:23,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:23,225 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. [2018-12-24 14:29:23,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-12-24 14:29:23,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:23,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:23,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:23,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:23,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2018-12-24 14:29:23,285 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:23,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 14:29:23,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 14:29:23,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-24 14:29:23,286 INFO L87 Difference]: Start difference. First operand 51 states and 193 transitions. Second operand 8 states. [2018-12-24 14:29:23,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:23,719 INFO L93 Difference]: Finished difference Result 64 states and 222 transitions. [2018-12-24 14:29:23,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 14:29:23,719 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-12-24 14:29:23,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:23,720 INFO L225 Difference]: With dead ends: 64 [2018-12-24 14:29:23,720 INFO L226 Difference]: Without dead ends: 56 [2018-12-24 14:29:23,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-12-24 14:29:23,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-24 14:29:23,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2018-12-24 14:29:23,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-24 14:29:23,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 187 transitions. [2018-12-24 14:29:23,871 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 187 transitions. Word has length 7 [2018-12-24 14:29:23,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:23,871 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 187 transitions. [2018-12-24 14:29:23,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 14:29:23,871 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 187 transitions. [2018-12-24 14:29:23,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 14:29:23,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:23,872 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 14:29:23,872 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:23,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:23,873 INFO L82 PathProgramCache]: Analyzing trace with hash 2042527720, now seen corresponding path program 2 times [2018-12-24 14:29:23,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:23,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:23,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:23,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:23,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:23,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:29:23,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:23,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:23,948 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:29:23,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:29:23,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:23,949 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 [2018-12-24 14:29:23,957 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:29:23,957 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:29:23,963 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 14:29:23,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:29:23,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:23,968 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 [2018-12-24 14:29:23,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:23,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:23,987 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 [2018-12-24 14:29:24,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:24,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:24,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:24,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:24,041 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 [2018-12-24 14:29:24,042 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:24,071 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:24,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:24,106 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 [2018-12-24 14:29:24,110 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 [2018-12-24 14:29:24,114 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 [2018-12-24 14:29:24,117 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 [2018-12-24 14:29:24,117 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:24,130 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:24,138 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:24,146 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:24,162 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. [2018-12-24 14:29:24,163 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2018-12-24 14:29:24,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:24,195 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 [2018-12-24 14:29:24,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:24,206 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. [2018-12-24 14:29:24,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2018-12-24 14:29:24,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:24,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:24,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:24,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:24,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:24,228 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 [2018-12-24 14:29:24,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:24,243 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. [2018-12-24 14:29:24,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2018-12-24 14:29:24,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:24,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:24,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:24,260 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:24,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:24,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:24,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:24,264 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:29:24,265 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 [2018-12-24 14:29:24,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:24,279 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. [2018-12-24 14:29:24,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2018-12-24 14:29:24,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:24,295 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:24,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:24,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:24,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 14:29:24,353 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:24,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 14:29:24,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 14:29:24,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2018-12-24 14:29:24,354 INFO L87 Difference]: Start difference. First operand 50 states and 187 transitions. Second operand 10 states. [2018-12-24 14:29:24,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:24,800 INFO L93 Difference]: Finished difference Result 76 states and 253 transitions. [2018-12-24 14:29:24,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 14:29:24,800 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2018-12-24 14:29:24,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:24,801 INFO L225 Difference]: With dead ends: 76 [2018-12-24 14:29:24,801 INFO L226 Difference]: Without dead ends: 67 [2018-12-24 14:29:24,802 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 [2018-12-24 14:29:24,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-24 14:29:24,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2018-12-24 14:29:24,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-24 14:29:24,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 191 transitions. [2018-12-24 14:29:24,948 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 191 transitions. Word has length 7 [2018-12-24 14:29:24,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:24,948 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 191 transitions. [2018-12-24 14:29:24,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 14:29:24,948 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 191 transitions. [2018-12-24 14:29:24,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 14:29:24,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:24,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 14:29:24,949 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:24,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:24,949 INFO L82 PathProgramCache]: Analyzing trace with hash -2141495906, now seen corresponding path program 1 times [2018-12-24 14:29:24,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:24,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:24,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:29:24,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:24,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:29:25,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:25,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:25,066 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 14:29:25,066 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [22], [24], [25] [2018-12-24 14:29:25,067 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:29:25,068 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:29:25,276 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:29:25,276 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 14:29:25,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:25,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:29:25,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:25,277 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 [2018-12-24 14:29:25,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:25,288 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:29:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:25,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:25,297 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 [2018-12-24 14:29:25,307 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 [2018-12-24 14:29:25,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:25,322 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:25,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:25,327 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 [2018-12-24 14:29:25,327 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:25,336 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:25,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:25,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, 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 [2018-12-24 14:29:25,361 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 [2018-12-24 14:29:25,369 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 [2018-12-24 14:29:25,380 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 [2018-12-24 14:29:25,381 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:25,391 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:25,399 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:25,407 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:25,420 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. [2018-12-24 14:29:25,421 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2018-12-24 14:29:25,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:25,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, 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 [2018-12-24 14:29:25,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-24 14:29:25,488 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. [2018-12-24 14:29:25,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2018-12-24 14:29:25,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:25,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:25,515 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:29:25,516 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 [2018-12-24 14:29:25,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:25,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:25,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:25,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:25,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:25,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:25,544 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 [2018-12-24 14:29:25,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:25,569 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. [2018-12-24 14:29:25,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:32 [2018-12-24 14:29:25,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:25,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:25,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:25,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:25,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2018-12-24 14:29:25,635 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:25,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 14:29:25,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 14:29:25,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-12-24 14:29:25,636 INFO L87 Difference]: Start difference. First operand 51 states and 191 transitions. Second operand 10 states. [2018-12-24 14:29:26,359 WARN L181 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2018-12-24 14:29:26,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:26,903 INFO L93 Difference]: Finished difference Result 90 states and 306 transitions. [2018-12-24 14:29:26,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 14:29:26,903 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2018-12-24 14:29:26,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:26,904 INFO L225 Difference]: With dead ends: 90 [2018-12-24 14:29:26,904 INFO L226 Difference]: Without dead ends: 77 [2018-12-24 14:29:26,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-12-24 14:29:26,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-24 14:29:27,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2018-12-24 14:29:27,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-24 14:29:27,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 241 transitions. [2018-12-24 14:29:27,138 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 241 transitions. Word has length 7 [2018-12-24 14:29:27,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:27,138 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 241 transitions. [2018-12-24 14:29:27,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 14:29:27,138 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 241 transitions. [2018-12-24 14:29:27,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 14:29:27,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:27,138 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-24 14:29:27,138 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:27,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:27,139 INFO L82 PathProgramCache]: Analyzing trace with hash -314363692, now seen corresponding path program 1 times [2018-12-24 14:29:27,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:27,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:27,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:27,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:27,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:27,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:29:27,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:27,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:27,282 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-24 14:29:27,282 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [24], [25] [2018-12-24 14:29:27,283 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:29:27,283 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:29:27,785 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:29:27,785 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 14:29:27,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:27,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:29:27,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:27,785 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 [2018-12-24 14:29:27,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:27,793 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:29:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:27,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:27,825 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 [2018-12-24 14:29:27,827 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 [2018-12-24 14:29:27,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:27,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:27,840 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 [2018-12-24 14:29:27,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:27,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:27,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:27,854 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 [2018-12-24 14:29:27,854 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:27,874 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:27,884 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:27,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:27,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:27,914 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 [2018-12-24 14:29:27,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:27,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:27,942 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 [2018-12-24 14:29:27,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:27,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:27,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:27,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:27,974 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 [2018-12-24 14:29:27,975 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:27,985 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:27,994 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:28,013 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. [2018-12-24 14:29:28,013 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2018-12-24 14:29:28,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:28,033 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 [2018-12-24 14:29:28,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:28,051 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. [2018-12-24 14:29:28,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 14:29:28,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:28,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:28,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:28,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:28,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:28,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:28,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, 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 [2018-12-24 14:29:28,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:28,097 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. [2018-12-24 14:29:28,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2018-12-24 14:29:28,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:28,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:28,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:28,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:28,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:28,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:28,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:28,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:28,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:28,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:28,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:28,126 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 [2018-12-24 14:29:28,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:28,154 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. [2018-12-24 14:29:28,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2018-12-24 14:29:28,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:28,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:28,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:28,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:28,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2018-12-24 14:29:28,231 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:28,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 14:29:28,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 14:29:28,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-12-24 14:29:28,232 INFO L87 Difference]: Start difference. First operand 63 states and 241 transitions. Second operand 11 states. [2018-12-24 14:29:28,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:28,950 INFO L93 Difference]: Finished difference Result 118 states and 409 transitions. [2018-12-24 14:29:28,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-24 14:29:28,951 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2018-12-24 14:29:28,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:28,952 INFO L225 Difference]: With dead ends: 118 [2018-12-24 14:29:28,952 INFO L226 Difference]: Without dead ends: 106 [2018-12-24 14:29:28,953 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 [2018-12-24 14:29:28,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-24 14:29:29,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 62. [2018-12-24 14:29:29,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-24 14:29:29,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 229 transitions. [2018-12-24 14:29:29,211 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 229 transitions. Word has length 8 [2018-12-24 14:29:29,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:29,211 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 229 transitions. [2018-12-24 14:29:29,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 14:29:29,211 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 229 transitions. [2018-12-24 14:29:29,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 14:29:29,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:29,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 14:29:29,212 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:29,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:29,212 INFO L82 PathProgramCache]: Analyzing trace with hash -307275420, now seen corresponding path program 1 times [2018-12-24 14:29:29,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:29,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:29,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:29,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:29,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:29,362 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:29,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:29,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:29,363 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-24 14:29:29,363 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [22], [23] [2018-12-24 14:29:29,364 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:29:29,364 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:29:30,150 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:29:30,150 INFO L272 AbstractInterpreter]: Visited 8 different actions 18 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-24 14:29:30,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:30,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:29:30,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:30,151 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 [2018-12-24 14:29:30,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:30,160 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:29:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:30,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:30,193 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 [2018-12-24 14:29:30,195 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 [2018-12-24 14:29:30,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,205 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 [2018-12-24 14:29:30,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,215 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 [2018-12-24 14:29:30,215 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:30,239 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:30,249 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:30,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:30,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,279 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 [2018-12-24 14:29:30,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,307 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 [2018-12-24 14:29:30,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,339 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 [2018-12-24 14:29:30,339 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:30,349 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:30,358 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:30,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:30,376 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2018-12-24 14:29:30,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,403 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 [2018-12-24 14:29:30,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:30,426 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. [2018-12-24 14:29:30,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 14:29:30,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,455 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 [2018-12-24 14:29:30,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:30,475 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. [2018-12-24 14:29:30,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2018-12-24 14:29:30,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,570 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,577 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:29:30,578 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 [2018-12-24 14:29:30,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:30,603 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. [2018-12-24 14:29:30,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2018-12-24 14:29:30,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,631 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:29:30,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:30,633 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 [2018-12-24 14:29:30,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:30,658 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. [2018-12-24 14:29:30,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2018-12-24 14:29:30,733 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:30,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:30,777 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:30,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:30,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2018-12-24 14:29:30,797 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:30,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-24 14:29:30,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-24 14:29:30,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-12-24 14:29:30,798 INFO L87 Difference]: Start difference. First operand 62 states and 229 transitions. Second operand 13 states. [2018-12-24 14:29:31,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:31,749 INFO L93 Difference]: Finished difference Result 124 states and 443 transitions. [2018-12-24 14:29:31,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-24 14:29:31,755 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-12-24 14:29:31,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:31,756 INFO L225 Difference]: With dead ends: 124 [2018-12-24 14:29:31,757 INFO L226 Difference]: Without dead ends: 119 [2018-12-24 14:29:31,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=300, Unknown=0, NotChecked=0, Total=462 [2018-12-24 14:29:31,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-24 14:29:32,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 73. [2018-12-24 14:29:32,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-24 14:29:32,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 277 transitions. [2018-12-24 14:29:32,071 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 277 transitions. Word has length 8 [2018-12-24 14:29:32,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:32,071 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 277 transitions. [2018-12-24 14:29:32,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-24 14:29:32,072 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 277 transitions. [2018-12-24 14:29:32,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 14:29:32,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:32,072 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-24 14:29:32,073 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:32,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:32,073 INFO L82 PathProgramCache]: Analyzing trace with hash -592077742, now seen corresponding path program 1 times [2018-12-24 14:29:32,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:32,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:32,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:32,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:32,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:32,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-24 14:29:32,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:32,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:32,164 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-24 14:29:32,164 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [22], [24], [25] [2018-12-24 14:29:32,165 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:29:32,165 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:29:32,364 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:29:32,365 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 14:29:32,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:32,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:29:32,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:32,365 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 [2018-12-24 14:29:32,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:32,373 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:29:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:32,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:32,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 15 treesize of output 18 [2018-12-24 14:29:32,385 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 [2018-12-24 14:29:32,396 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 [2018-12-24 14:29:32,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:32,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:32,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:32,412 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 [2018-12-24 14:29:32,413 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:32,432 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:32,442 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:32,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:32,465 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 [2018-12-24 14:29:32,469 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 [2018-12-24 14:29:32,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:32,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:32,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:32,485 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 [2018-12-24 14:29:32,486 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:32,490 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:32,496 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:32,510 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. [2018-12-24 14:29:32,510 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2018-12-24 14:29:32,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:32,545 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 [2018-12-24 14:29:32,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-24 14:29:32,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-24 14:29:32,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2018-12-24 14:29:32,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:32,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:32,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:32,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:32,603 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 [2018-12-24 14:29:32,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:32,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:32,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:32,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:32,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:32,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:32,632 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 [2018-12-24 14:29:32,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:32,652 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. [2018-12-24 14:29:32,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:32 [2018-12-24 14:29:32,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:32,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:32,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:32,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:32,679 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 [2018-12-24 14:29:32,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:32,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:32,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:32,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:32,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:32,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:32,709 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 [2018-12-24 14:29:32,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:32,731 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. [2018-12-24 14:29:32,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:28 [2018-12-24 14:29:32,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:32,757 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:32,793 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:32,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:32,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2018-12-24 14:29:32,815 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:32,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-24 14:29:32,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-24 14:29:32,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-12-24 14:29:32,816 INFO L87 Difference]: Start difference. First operand 73 states and 277 transitions. Second operand 9 states. [2018-12-24 14:29:33,111 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2018-12-24 14:29:33,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:33,633 INFO L93 Difference]: Finished difference Result 87 states and 314 transitions. [2018-12-24 14:29:33,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 14:29:33,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-24 14:29:33,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:33,635 INFO L225 Difference]: With dead ends: 87 [2018-12-24 14:29:33,635 INFO L226 Difference]: Without dead ends: 80 [2018-12-24 14:29:33,635 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 [2018-12-24 14:29:33,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-24 14:29:34,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-12-24 14:29:34,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-24 14:29:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 297 transitions. [2018-12-24 14:29:34,018 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 297 transitions. Word has length 8 [2018-12-24 14:29:34,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:34,018 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 297 transitions. [2018-12-24 14:29:34,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-24 14:29:34,018 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 297 transitions. [2018-12-24 14:29:34,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 14:29:34,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:34,019 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 14:29:34,019 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:34,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:34,020 INFO L82 PathProgramCache]: Analyzing trace with hash -477682288, now seen corresponding path program 2 times [2018-12-24 14:29:34,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:34,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:34,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:34,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:34,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:34,169 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-24 14:29:34,305 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:29:34,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:34,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:34,306 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:29:34,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:29:34,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:34,306 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 [2018-12-24 14:29:34,314 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:29:34,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:29:34,319 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 14:29:34,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:29:34,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:34,323 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 [2018-12-24 14:29:34,325 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 [2018-12-24 14:29:34,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,331 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 [2018-12-24 14:29:34,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,360 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 [2018-12-24 14:29:34,360 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:34,375 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:34,383 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:34,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:34,408 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 [2018-12-24 14:29:34,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,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, 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 [2018-12-24 14:29:34,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,451 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 [2018-12-24 14:29:34,452 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:34,460 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:34,470 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:34,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:34,487 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:41, output treesize:41 [2018-12-24 14:29:34,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,522 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 [2018-12-24 14:29:34,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-24 14:29:34,581 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. [2018-12-24 14:29:34,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:58 [2018-12-24 14:29:34,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,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, 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 [2018-12-24 14:29:34,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:34,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,702 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:29:34,703 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 [2018-12-24 14:29:34,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:34,754 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. [2018-12-24 14:29:34,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:74, output treesize:54 [2018-12-24 14:29:34,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,808 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:29:34,808 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 [2018-12-24 14:29:34,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:34,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,853 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 [2018-12-24 14:29:34,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:34,880 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. [2018-12-24 14:29:34,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:48 [2018-12-24 14:29:34,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,921 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 [2018-12-24 14:29:34,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:34,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,961 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:34,967 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:29:34,968 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 [2018-12-24 14:29:34,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:35,003 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. [2018-12-24 14:29:35,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:68, output treesize:48 [2018-12-24 14:29:35,044 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:35,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:35,096 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:35,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:35,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2018-12-24 14:29:35,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:35,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-24 14:29:35,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-24 14:29:35,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-12-24 14:29:35,116 INFO L87 Difference]: Start difference. First operand 78 states and 297 transitions. Second operand 13 states. [2018-12-24 14:29:36,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:36,508 INFO L93 Difference]: Finished difference Result 186 states and 694 transitions. [2018-12-24 14:29:36,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-24 14:29:36,508 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-12-24 14:29:36,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:36,510 INFO L225 Difference]: With dead ends: 186 [2018-12-24 14:29:36,510 INFO L226 Difference]: Without dead ends: 177 [2018-12-24 14:29:36,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2018-12-24 14:29:36,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-24 14:29:36,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 95. [2018-12-24 14:29:36,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-24 14:29:36,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 371 transitions. [2018-12-24 14:29:36,998 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 371 transitions. Word has length 8 [2018-12-24 14:29:36,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:36,998 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 371 transitions. [2018-12-24 14:29:36,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-24 14:29:36,999 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 371 transitions. [2018-12-24 14:29:36,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 14:29:36,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:36,999 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 14:29:36,999 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:36,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:37,000 INFO L82 PathProgramCache]: Analyzing trace with hash -931909288, now seen corresponding path program 1 times [2018-12-24 14:29:37,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:37,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:37,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:29:37,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:37,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:37,119 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-24 14:29:37,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:37,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:37,119 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-24 14:29:37,119 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [24], [25] [2018-12-24 14:29:37,120 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:29:37,120 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:29:37,933 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:29:37,933 INFO L272 AbstractInterpreter]: Visited 8 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-24 14:29:37,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:37,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:29:37,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:37,934 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 [2018-12-24 14:29:37,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:37,944 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:29:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:37,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:37,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:37,977 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 [2018-12-24 14:29:38,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,021 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 [2018-12-24 14:29:38,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,054 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 [2018-12-24 14:29:38,054 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:38,064 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:38,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:38,089 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 [2018-12-24 14:29:38,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, 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 [2018-12-24 14:29:38,094 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 [2018-12-24 14:29:38,096 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 [2018-12-24 14:29:38,096 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:38,109 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:38,117 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:38,125 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:38,144 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. [2018-12-24 14:29:38,144 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 14:29:38,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,170 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 [2018-12-24 14:29:38,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:38,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. [2018-12-24 14:29:38,187 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 14:29:38,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,212 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 [2018-12-24 14:29:38,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:38,233 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. [2018-12-24 14:29:38,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2018-12-24 14:29:38,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,259 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:29:38,260 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 [2018-12-24 14:29:38,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:38,285 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. [2018-12-24 14:29:38,286 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2018-12-24 14:29:38,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,311 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:38,319 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 [2018-12-24 14:29:38,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:38,348 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. [2018-12-24 14:29:38,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2018-12-24 14:29:38,369 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:38,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:38,412 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:38,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:38,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2018-12-24 14:29:38,432 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:38,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 14:29:38,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 14:29:38,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2018-12-24 14:29:38,433 INFO L87 Difference]: Start difference. First operand 95 states and 371 transitions. Second operand 12 states. [2018-12-24 14:29:39,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:39,288 INFO L93 Difference]: Finished difference Result 110 states and 418 transitions. [2018-12-24 14:29:39,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 14:29:39,292 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2018-12-24 14:29:39,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:39,293 INFO L225 Difference]: With dead ends: 110 [2018-12-24 14:29:39,293 INFO L226 Difference]: Without dead ends: 80 [2018-12-24 14:29:39,293 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 [2018-12-24 14:29:39,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-24 14:29:39,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 26. [2018-12-24 14:29:39,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-24 14:29:39,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2018-12-24 14:29:39,407 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 9 [2018-12-24 14:29:39,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:39,407 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2018-12-24 14:29:39,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 14:29:39,408 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2018-12-24 14:29:39,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 14:29:39,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:39,408 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 14:29:39,408 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:39,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:39,408 INFO L82 PathProgramCache]: Analyzing trace with hash -898856470, now seen corresponding path program 3 times [2018-12-24 14:29:39,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:39,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:39,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:39,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:39,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:39,534 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-24 14:29:39,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:39,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:39,535 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:29:39,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:29:39,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:39,535 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 [2018-12-24 14:29:39,546 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:29:39,546 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:29:39,550 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:29:39,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:29:39,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:39,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,571 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 [2018-12-24 14:29:39,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,600 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 [2018-12-24 14:29:39,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,634 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 [2018-12-24 14:29:39,634 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:39,645 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:39,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:39,670 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 [2018-12-24 14:29:39,673 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 [2018-12-24 14:29:39,674 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 [2018-12-24 14:29:39,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, 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 [2018-12-24 14:29:39,677 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:39,693 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:39,702 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:39,710 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:39,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:39,730 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2018-12-24 14:29:39,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,757 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 [2018-12-24 14:29:39,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:39,778 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. [2018-12-24 14:29:39,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 14:29:39,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,807 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 [2018-12-24 14:29:39,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:39,829 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. [2018-12-24 14:29:39,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:25 [2018-12-24 14:29:39,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,860 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,860 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:29:39,861 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 [2018-12-24 14:29:39,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:39,885 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. [2018-12-24 14:29:39,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:27 [2018-12-24 14:29:39,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,916 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:29:39,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,918 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 [2018-12-24 14:29:39,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:39,943 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. [2018-12-24 14:29:39,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:29 [2018-12-24 14:29:39,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,973 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:29:39,976 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 [2018-12-24 14:29:39,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:39,998 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. [2018-12-24 14:29:39,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2018-12-24 14:29:40,022 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:40,022 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:40,093 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:40,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:40,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2018-12-24 14:29:40,112 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:40,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-24 14:29:40,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-24 14:29:40,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2018-12-24 14:29:40,113 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 13 states. [2018-12-24 14:29:40,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:40,622 INFO L93 Difference]: Finished difference Result 32 states and 109 transitions. [2018-12-24 14:29:40,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 14:29:40,622 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2018-12-24 14:29:40,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:40,623 INFO L225 Difference]: With dead ends: 32 [2018-12-24 14:29:40,623 INFO L226 Difference]: Without dead ends: 0 [2018-12-24 14:29:40,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2018-12-24 14:29:40,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-24 14:29:40,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-24 14:29:40,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-24 14:29:40,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-24 14:29:40,625 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2018-12-24 14:29:40,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:40,626 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-24 14:29:40,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-24 14:29:40,626 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-24 14:29:40,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-24 14:29:40,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-24 14:29:40,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:29:40,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:29:41,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:29:41,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:29:41,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:29:41,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:29:41,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:29:41,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:29:41,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:29:41,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:29:41,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:29:41,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:29:41,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:29:41,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:29:41,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:29:41,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:29:41,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:29:41,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:29:42,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:29:42,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:29:42,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:29:42,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:29:42,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:29:42,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:29:46,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:29:46,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:29:47,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:29:47,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:29:52,850 WARN L181 SmtUtils]: Spent 12.21 s on a formula simplification. DAG size of input: 1487 DAG size of output: 1019 [2018-12-24 14:30:07,103 WARN L181 SmtUtils]: Spent 14.24 s on a formula simplification. DAG size of input: 964 DAG size of output: 85 [2018-12-24 14:30:07,106 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2018-12-24 14:30:07,107 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 42) no Hoare annotation was computed. [2018-12-24 14:30:07,107 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-12-24 14:30:07,107 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-12-24 14:30:07,107 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 40) no Hoare annotation was computed. [2018-12-24 14:30:07,107 INFO L444 ceAbstractionStarter]: At program point L32-1(lines 27 37) the Hoare annotation is: (let ((.cse15 (select |#memory_int| ULTIMATE.start_main_p4))) (let ((.cse20 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse15 (- 1))))) (let ((.cse19 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse17 (select |#memory_int| ULTIMATE.start_main_p3)) (.cse7 (select .cse20 ULTIMATE.start_main_p1))) (let ((.cse16 (select |#memory_int| ULTIMATE.start_main_p2)) (.cse0 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (.cse11 (<= 1 .cse7)) (.cse14 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4))) (.cse22 (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse17 1))) (.cse21 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse19 1)))) (let ((.cse4 (<= (+ (select .cse21 ULTIMATE.start_main_p4) 1) 0)) (.cse8 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (.cse5 (<= .cse15 0)) (.cse18 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4))) (.cse3 (= 0 (select .cse22 ULTIMATE.start_main_p2))) (.cse12 (= 0 (select .cse20 ULTIMATE.start_main_p2))) (.cse9 (and .cse0 .cse11 .cse14)) (.cse1 (= 0 (select .cse22 ULTIMATE.start_main_p1))) (.cse2 (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse16 (- 1)))) (.cse6 (<= (+ (select .cse21 ULTIMATE.start_main_p2) 1) 0)) (.cse13 (select .cse20 ULTIMATE.start_main_p3))) (or (and (and .cse0 .cse1 (= 0 (select .cse2 ULTIMATE.start_main_p3)) .cse3) .cse4) (let ((.cse10 (= 0 .cse13))) (or (and .cse5 (and (or (and .cse6 (= 0 .cse7) .cse8) (and .cse6 .cse9)) .cse10)) (and (and .cse10 .cse11 .cse12 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) .cse4))) (and .cse14 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= .cse15 0) (<= .cse16 0) (= .cse17 0) .cse8 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) .cse18 (<= 0 .cse19)) (and .cse5 (and (or (and .cse14 .cse0 .cse1 .cse18 .cse3) (or (and .cse12 .cse9) (and .cse6 (and .cse1 .cse14)) (and (<= 1 (select .cse2 ULTIMATE.start_main_p1)) .cse6))) (<= 1 .cse13))))))))) [2018-12-24 14:30:07,107 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2018-12-24 14:30:07,107 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2018-12-24 14:30:07,108 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 44) no Hoare annotation was computed. [2018-12-24 14:30:07,108 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2018-12-24 14:30:07,108 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 41) no Hoare annotation was computed. [2018-12-24 14:30:07,123 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 02:30:07 BoogieIcfgContainer [2018-12-24 14:30:07,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-24 14:30:07,124 INFO L168 Benchmark]: Toolchain (without parser) took 118598.52 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.2 GB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -242.4 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-12-24 14:30:07,124 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 14:30:07,125 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.08 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 14:30:07,125 INFO L168 Benchmark]: Boogie Preprocessor took 24.59 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 14:30:07,125 INFO L168 Benchmark]: RCFGBuilder took 405.21 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-24 14:30:07,125 INFO L168 Benchmark]: TraceAbstraction took 118105.24 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.2 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -263.5 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-12-24 14:30:07,127 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.08 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.59 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 405.21 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 118105.24 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.2 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -263.5 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 40]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 41]: 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 - PositiveResult [Line: 39]: 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 == 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) || (#memory_int[p4] <= 0 && (((#memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0 && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p3)) || (#memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0 && (!(p1 == p2) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p4))) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p3]) || ((((0 == #memory_int[p4 := #memory_int[p4] + -1][p3] && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && !(p2 == p3)) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0)) || (((((((((!(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])) || (#memory_int[p4] <= 0 && (((((!(p1 == p4) && !(p1 == p2)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1]) && !(p2 == p4)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) || ((0 == #memory_int[p4 := #memory_int[p4] + -1][p2] && (!(p1 == p2) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p4)) || (#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)) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 4 error locations. SAFE Result, 118.0s OverallTime, 55 OverallIterations, 3 TraceHistogramMax, 25.6s AutomataDifference, 0.0s DeadEndRemovalTime, 26.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 198 SDtfs, 956 SDslu, 1 SDs, 0 SdLazy, 9084 SolverSat, 820 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 838 GetRequests, 140 SyntacticMatches, 32 SemanticMatches, 666 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2560 ImplicationChecksByTransitivity, 19.1s 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, 25.9s AbstIntTime, 36 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 55 MinimizatonAttempts, 1314 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 46 NumberOfFragments, 397 HoareAnnotationTreeSize, 1 FomulaSimplifications, 4094942593 FormulaSimplificationTreeSizeReduction, 12.2s HoareSimplificationTime, 1 FomulaSimplificationsInter, 37002537 FormulaSimplificationTreeSizeReductionInter, 14.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 33.2s InterpolantComputationTime, 609 NumberOfCodeBlocks, 609 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 748 ConstructedInterpolants, 222 QuantifiedInterpolants, 91495 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...