java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-e1a14da [2018-12-24 13:51:52,516 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-24 13:51:52,518 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-24 13:51:52,531 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-24 13:51:52,532 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-24 13:51:52,536 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-24 13:51:52,537 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-24 13:51:52,539 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-24 13:51:52,541 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-24 13:51:52,542 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-24 13:51:52,543 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-24 13:51:52,543 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-24 13:51:52,544 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-24 13:51:52,545 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-24 13:51:52,547 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-24 13:51:52,548 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-24 13:51:52,550 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-24 13:51:52,552 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-24 13:51:52,557 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-24 13:51:52,561 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-24 13:51:52,562 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-24 13:51:52,564 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-24 13:51:52,569 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-24 13:51:52,570 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-24 13:51:52,570 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-24 13:51:52,571 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-24 13:51:52,572 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-24 13:51:52,573 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-24 13:51:52,574 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-24 13:51:52,575 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-24 13:51:52,575 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-24 13:51:52,576 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-24 13:51:52,576 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-24 13:51:52,576 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-24 13:51:52,577 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-24 13:51:52,578 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-24 13:51:52,578 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-24 13:51:52,593 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-24 13:51:52,594 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-24 13:51:52,595 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-24 13:51:52,595 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-24 13:51:52,598 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-24 13:51:52,598 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-24 13:51:52,598 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-24 13:51:52,599 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-24 13:51:52,599 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-24 13:51:52,599 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-24 13:51:52,599 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-24 13:51:52,600 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-24 13:51:52,600 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-24 13:51:52,600 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-24 13:51:52,602 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-24 13:51:52,602 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-24 13:51:52,602 INFO L133 SettingsManager]: * Use SBE=true [2018-12-24 13:51:52,602 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-24 13:51:52,603 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-24 13:51:52,603 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-24 13:51:52,603 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-24 13:51:52,603 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-24 13:51:52,603 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-24 13:51:52,605 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-24 13:51:52,605 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-24 13:51:52,606 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-24 13:51:52,606 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-24 13:51:52,606 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-24 13:51:52,606 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-24 13:51:52,607 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-24 13:51:52,608 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-24 13:51:52,608 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 13:51:52,608 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-24 13:51:52,608 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-24 13:51:52,609 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-24 13:51:52,609 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-24 13:51:52,609 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-24 13:51:52,609 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-24 13:51:52,609 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-24 13:51:52,610 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-24 13:51:52,650 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-24 13:51:52,668 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-24 13:51:52,672 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-24 13:51:52,674 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-24 13:51:52,674 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-24 13:51:52,675 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl [2018-12-24 13:51:52,675 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl' [2018-12-24 13:51:52,726 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-24 13:51:52,728 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-24 13:51:52,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-24 13:51:52,730 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-24 13:51:52,730 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-24 13:51:52,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:52" (1/1) ... [2018-12-24 13:51:52,763 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:52" (1/1) ... [2018-12-24 13:51:52,793 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-24 13:51:52,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-24 13:51:52,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-24 13:51:52,795 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-24 13:51:52,807 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:52" (1/1) ... [2018-12-24 13:51:52,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:52" (1/1) ... [2018-12-24 13:51:52,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:52" (1/1) ... [2018-12-24 13:51:52,809 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:52" (1/1) ... [2018-12-24 13:51:52,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:52" (1/1) ... [2018-12-24 13:51:52,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:52" (1/1) ... [2018-12-24 13:51:52,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:52" (1/1) ... [2018-12-24 13:51:52,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-24 13:51:52,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-24 13:51:52,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-24 13:51:52,821 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-24 13:51:52,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:52" (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 13:51:52,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-24 13:51:52,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-24 13:51:53,113 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-24 13:51:53,114 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-12-24 13:51:53,114 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:51:53 BoogieIcfgContainer [2018-12-24 13:51:53,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-24 13:51:53,119 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-24 13:51:53,119 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-24 13:51:53,123 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-24 13:51:53,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:52" (1/2) ... [2018-12-24 13:51:53,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770affd0 and model type speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:51:53, skipping insertion in model container [2018-12-24 13:51:53,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:51:53" (2/2) ... [2018-12-24 13:51:53,128 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-limited.bpl [2018-12-24 13:51:53,141 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-24 13:51:53,150 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-12-24 13:51:53,169 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-12-24 13:51:53,214 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-24 13:51:53,214 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-24 13:51:53,214 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-24 13:51:53,215 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-24 13:51:53,215 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-24 13:51:53,215 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-24 13:51:53,215 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-24 13:51:53,216 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-24 13:51:53,236 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2018-12-24 13:51:53,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-24 13:51:53,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:53,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-24 13:51:53,255 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:53,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:53,263 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2018-12-24 13:51:53,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:53,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:53,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:53,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:53,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:53,498 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 13:51:53,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 13:51:53,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-24 13:51:53,502 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:51:53,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 13:51:53,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 13:51:53,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 13:51:53,535 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2018-12-24 13:51:53,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:53,715 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2018-12-24 13:51:53,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:51:53,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-24 13:51:53,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:53,730 INFO L225 Difference]: With dead ends: 21 [2018-12-24 13:51:53,730 INFO L226 Difference]: Without dead ends: 16 [2018-12-24 13:51:53,735 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 13:51:53,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-24 13:51:53,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2018-12-24 13:51:53,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-24 13:51:53,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2018-12-24 13:51:53,766 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2018-12-24 13:51:53,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:53,767 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2018-12-24 13:51:53,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 13:51:53,768 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2018-12-24 13:51:53,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 13:51:53,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:53,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 13:51:53,769 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:53,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:53,770 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2018-12-24 13:51:53,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:53,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:53,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:53,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:53,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:53,917 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 13:51:53,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:53,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:53,919 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-24 13:51:53,921 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2018-12-24 13:51:53,961 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:53,961 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:54,037 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:54,039 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 3. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:51:54,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:54,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:54,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:54,047 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 13:51:54,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:54,068 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:54,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:54,154 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 13:51:54,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:54,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, 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 13:51:54,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:54,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:54,183 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 13:51:54,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:54,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:54,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:54,220 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 13:51:54,221 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:54,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:54,479 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:54,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:54,636 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 13:51:54,637 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2018-12-24 13:51:54,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:54,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:54,730 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:54,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:54,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:54,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:54,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:54,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 13:51:54,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:54,796 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 13:51:54,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:51:54,927 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 13:51:54,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:54,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 13:51:54,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:54,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 13:51:54,973 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:54,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 13:51:54,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 13:51:54,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:51:54,976 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2018-12-24 13:51:55,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:55,383 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2018-12-24 13:51:55,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 13:51:55,384 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2018-12-24 13:51:55,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:55,386 INFO L225 Difference]: With dead ends: 31 [2018-12-24 13:51:55,386 INFO L226 Difference]: Without dead ends: 28 [2018-12-24 13:51:55,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-12-24 13:51:55,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-24 13:51:55,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 13. [2018-12-24 13:51:55,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-24 13:51:55,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2018-12-24 13:51:55,393 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2018-12-24 13:51:55,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:55,393 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2018-12-24 13:51:55,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 13:51:55,394 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2018-12-24 13:51:55,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 13:51:55,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:55,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 13:51:55,395 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:55,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:55,396 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2018-12-24 13:51:55,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:55,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:55,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:55,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:55,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:55,429 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 13:51:55,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 13:51:55,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-24 13:51:55,430 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:51:55,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 13:51:55,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 13:51:55,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 13:51:55,431 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2018-12-24 13:51:55,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:55,497 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2018-12-24 13:51:55,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:51:55,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-24 13:51:55,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:55,499 INFO L225 Difference]: With dead ends: 15 [2018-12-24 13:51:55,499 INFO L226 Difference]: Without dead ends: 14 [2018-12-24 13:51:55,500 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 13:51:55,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-24 13:51:55,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-12-24 13:51:55,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-24 13:51:55,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2018-12-24 13:51:55,504 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2018-12-24 13:51:55,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:55,505 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2018-12-24 13:51:55,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 13:51:55,505 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2018-12-24 13:51:55,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 13:51:55,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:55,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 13:51:55,506 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:55,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:55,507 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2018-12-24 13:51:55,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:55,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:55,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:55,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:55,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:55,592 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 13:51:55,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:55,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:55,593 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-24 13:51:55,593 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2018-12-24 13:51:55,598 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:55,599 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:55,612 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:55,612 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 3. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:51:55,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:55,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:55,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:55,613 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 13:51:55,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:55,628 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:55,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:55,645 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 13:51:55,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:55,678 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 13:51:55,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:55,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:55,749 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 13:51:55,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:55,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:55,847 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:55,851 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 13:51:55,852 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:56,023 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:56,035 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:56,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:56,070 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 13:51:56,071 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:25, output treesize:30 [2018-12-24 13:51:56,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:56,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:56,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:56,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:56,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:56,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:56,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:56,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, 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 13:51:56,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:56,198 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 13:51:56,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:51:56,232 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 13:51:56,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:56,261 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 13:51:56,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-24 13:51:56,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2018-12-24 13:51:56,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:51:56,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 13:51:56,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 13:51:56,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:51:56,282 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 4 states. [2018-12-24 13:51:56,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:56,358 INFO L93 Difference]: Finished difference Result 18 states and 41 transitions. [2018-12-24 13:51:56,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-24 13:51:56,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-24 13:51:56,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:56,360 INFO L225 Difference]: With dead ends: 18 [2018-12-24 13:51:56,360 INFO L226 Difference]: Without dead ends: 17 [2018-12-24 13:51:56,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:51:56,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-24 13:51:56,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-12-24 13:51:56,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-24 13:51:56,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2018-12-24 13:51:56,366 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3 [2018-12-24 13:51:56,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:56,367 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2018-12-24 13:51:56,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 13:51:56,367 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2018-12-24 13:51:56,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 13:51:56,368 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:56,368 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 13:51:56,368 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:56,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:56,369 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2018-12-24 13:51:56,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:56,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:56,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:56,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:56,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:56,438 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 13:51:56,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:56,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:56,439 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-24 13:51:56,439 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2018-12-24 13:51:56,511 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:56,511 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:56,518 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:56,518 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 3. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:51:56,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:56,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:56,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:56,520 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 13:51:56,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:56,539 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:56,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:56,569 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 13:51:56,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:56,577 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 13:51:56,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:56,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:56,589 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 13:51:56,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:56,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:56,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:56,609 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 13:51:56,610 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:56,641 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:56,676 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:56,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:56,704 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 13:51:56,705 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2018-12-24 13:51:56,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:56,742 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:56,743 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:56,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:56,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:56,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:56,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:56,759 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 13:51:56,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:56,867 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 13:51:56,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:51:56,921 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 13:51:56,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:56,936 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 13:51:56,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:56,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 13:51:56,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:56,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 13:51:56,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 13:51:56,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:51:56,956 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 6 states. [2018-12-24 13:51:57,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:57,134 INFO L93 Difference]: Finished difference Result 32 states and 62 transitions. [2018-12-24 13:51:57,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 13:51:57,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2018-12-24 13:51:57,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:57,137 INFO L225 Difference]: With dead ends: 32 [2018-12-24 13:51:57,137 INFO L226 Difference]: Without dead ends: 31 [2018-12-24 13:51:57,138 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 13:51:57,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-24 13:51:57,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2018-12-24 13:51:57,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-24 13:51:57,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2018-12-24 13:51:57,143 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 50 transitions. Word has length 3 [2018-12-24 13:51:57,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:57,144 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 50 transitions. [2018-12-24 13:51:57,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 13:51:57,144 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 50 transitions. [2018-12-24 13:51:57,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:51:57,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:57,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:51:57,145 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:57,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:57,145 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2018-12-24 13:51:57,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:57,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:57,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:57,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:57,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:57,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 13:51:57,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:57,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:57,202 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:51:57,202 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2018-12-24 13:51:57,204 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:57,204 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:57,225 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:57,228 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:51:57,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:57,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:57,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:57,229 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 13:51:57,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:57,239 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:57,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:57,252 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 13:51:57,258 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 13:51:57,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:57,268 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-12-24 13:51:57,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:57,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:57,292 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 13:51:57,293 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:57,312 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:57,328 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:57,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:57,365 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 13:51:57,365 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2018-12-24 13:51:57,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:57,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:57,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:57,473 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:57,474 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 13:51:57,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:57,496 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 13:51:57,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2018-12-24 13:51:57,524 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 13:51:57,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:57,542 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 13:51:57,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-24 13:51:57,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2018-12-24 13:51:57,561 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:51:57,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 13:51:57,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 13:51:57,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:51:57,562 INFO L87 Difference]: Start difference. First operand 18 states and 50 transitions. Second operand 4 states. [2018-12-24 13:51:57,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:57,603 INFO L93 Difference]: Finished difference Result 22 states and 58 transitions. [2018-12-24 13:51:57,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:51:57,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-24 13:51:57,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:57,604 INFO L225 Difference]: With dead ends: 22 [2018-12-24 13:51:57,605 INFO L226 Difference]: Without dead ends: 21 [2018-12-24 13:51:57,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:51:57,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-24 13:51:57,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-12-24 13:51:57,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-24 13:51:57,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2018-12-24 13:51:57,611 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2018-12-24 13:51:57,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:57,612 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2018-12-24 13:51:57,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 13:51:57,612 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2018-12-24 13:51:57,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:51:57,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:57,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:51:57,613 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:57,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:57,613 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2018-12-24 13:51:57,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:57,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:57,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:57,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:57,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:57,755 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 13:51:57,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:57,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:57,756 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:51:57,756 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2018-12-24 13:51:57,758 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:57,758 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:57,764 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:57,764 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:51:57,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:57,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:57,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:57,765 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 13:51:57,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:57,784 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:57,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:57,809 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 13:51:57,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:57,817 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 13:51:57,824 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:57,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:57,827 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 13:51:57,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:57,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:57,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:57,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, 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 13:51:57,840 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:57,870 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:57,881 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:57,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:57,903 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 13:51:57,904 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2018-12-24 13:51:57,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:57,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:57,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:57,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:57,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:57,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:57,939 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:57,941 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 13:51:57,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:58,003 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 13:51:58,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:51:58,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:58,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:58,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:58,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:58,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:58,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:58,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:58,037 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:51:58,040 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 13:51:58,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:58,147 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 13:51:58,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2018-12-24 13:51:58,166 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 13:51:58,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:58,193 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 13:51:58,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:58,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:51:58,212 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:58,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:51:58,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:51:58,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:51:58,214 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 8 states. [2018-12-24 13:51:58,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:58,514 INFO L93 Difference]: Finished difference Result 37 states and 74 transitions. [2018-12-24 13:51:58,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:51:58,515 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-24 13:51:58,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:58,516 INFO L225 Difference]: With dead ends: 37 [2018-12-24 13:51:58,516 INFO L226 Difference]: Without dead ends: 36 [2018-12-24 13:51:58,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:51:58,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-24 13:51:58,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. [2018-12-24 13:51:58,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-24 13:51:58,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2018-12-24 13:51:58,525 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 4 [2018-12-24 13:51:58,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:58,525 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2018-12-24 13:51:58,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:51:58,525 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2018-12-24 13:51:58,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:51:58,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:58,526 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:51:58,526 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:58,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:58,526 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2018-12-24 13:51:58,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:58,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:58,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:58,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:58,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:58,645 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 13:51:58,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:58,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:58,646 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:51:58,646 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2018-12-24 13:51:58,651 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:58,651 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:58,657 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:58,657 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:51:58,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:58,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:58,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:58,658 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 13:51:58,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:58,670 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:58,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:58,684 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 13:51:58,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:58,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, 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 13:51:58,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:58,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:58,700 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 13:51:58,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:58,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:58,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:58,716 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 13:51:58,716 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:58,736 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:58,746 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:58,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:58,771 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 13:51:58,771 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2018-12-24 13:51:58,975 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-24 13:51:59,017 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:59,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:59,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:59,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:59,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:59,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:59,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:59,100 INFO L303 Elim1Store]: Index analysis took 120 ms [2018-12-24 13:51:59,101 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 13:51:59,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:59,132 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 13:51:59,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:51:59,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:59,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:59,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:59,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:59,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:59,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:59,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:59,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:59,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:59,234 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 13:51:59,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:59,269 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 13:51:59,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2018-12-24 13:51:59,284 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 13:51:59,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:59,354 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 13:51:59,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:59,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:51:59,374 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:59,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:51:59,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:51:59,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:51:59,375 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 8 states. [2018-12-24 13:51:59,633 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-12-24 13:51:59,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:59,813 INFO L93 Difference]: Finished difference Result 42 states and 89 transitions. [2018-12-24 13:51:59,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:51:59,814 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-24 13:51:59,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:59,815 INFO L225 Difference]: With dead ends: 42 [2018-12-24 13:51:59,816 INFO L226 Difference]: Without dead ends: 38 [2018-12-24 13:51:59,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:51:59,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-24 13:51:59,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 22. [2018-12-24 13:51:59,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-24 13:51:59,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 65 transitions. [2018-12-24 13:51:59,826 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 65 transitions. Word has length 4 [2018-12-24 13:51:59,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:59,826 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 65 transitions. [2018-12-24 13:51:59,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:51:59,826 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 65 transitions. [2018-12-24 13:51:59,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:51:59,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:59,827 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:51:59,828 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:59,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:59,828 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 1 times [2018-12-24 13:51:59,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:59,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:59,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:59,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:59,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:59,988 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 13:51:59,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:59,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:59,989 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:51:59,989 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2018-12-24 13:51:59,991 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:59,991 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:59,996 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:59,997 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:51:59,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:59,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:59,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:59,998 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 13:52:00,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:00,009 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:00,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:00,020 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 13:52:00,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:00,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:52:00,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:00,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:00,036 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 13:52:00,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:00,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:00,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:00,054 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 13:52:00,054 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:00,078 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:00,088 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:00,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:00,114 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 13:52:00,115 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:00,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:00,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:00,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:00,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:00,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:00,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:00,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:00,172 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 13:52:00,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:00,207 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 13:52:00,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:00,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:00,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:00,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:00,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:00,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:00,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:00,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:00,260 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:00,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:00,263 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 13:52:00,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:00,315 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 13:52:00,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:00,332 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 13:52:00,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:00,395 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 13:52:00,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:00,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:52:00,415 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:00,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:52:00,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:52:00,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:52:00,416 INFO L87 Difference]: Start difference. First operand 22 states and 65 transitions. Second operand 8 states. [2018-12-24 13:52:00,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:00,805 INFO L93 Difference]: Finished difference Result 51 states and 112 transitions. [2018-12-24 13:52:00,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:52:00,805 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-24 13:52:00,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:00,806 INFO L225 Difference]: With dead ends: 51 [2018-12-24 13:52:00,806 INFO L226 Difference]: Without dead ends: 48 [2018-12-24 13:52:00,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:52:00,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-24 13:52:00,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 28. [2018-12-24 13:52:00,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-24 13:52:00,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 88 transitions. [2018-12-24 13:52:00,817 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 88 transitions. Word has length 4 [2018-12-24 13:52:00,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:00,817 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 88 transitions. [2018-12-24 13:52:00,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:52:00,818 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 88 transitions. [2018-12-24 13:52:00,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:52:00,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:00,818 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:52:00,819 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:00,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:00,819 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2018-12-24 13:52:00,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:00,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:00,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:00,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:00,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:00,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 13:52:00,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:00,920 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:00,920 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:52:00,920 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2018-12-24 13:52:00,926 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:00,926 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:00,931 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:00,931 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:52:00,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:00,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:00,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:00,932 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 13:52:00,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:00,941 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:00,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:00,951 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 13:52:00,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:00,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 13:52:00,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:00,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:00,978 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 13:52:01,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,025 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 13:52:01,026 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:01,063 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:01,078 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:01,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:01,103 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 13:52:01,103 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:01,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,157 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 13:52:01,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:01,214 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 13:52:01,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:01,270 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 13:52:01,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:01,304 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 13:52:01,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:01,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 13:52:01,323 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:01,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 13:52:01,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 13:52:01,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:52:01,325 INFO L87 Difference]: Start difference. First operand 28 states and 88 transitions. Second operand 6 states. [2018-12-24 13:52:01,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:01,538 INFO L93 Difference]: Finished difference Result 36 states and 98 transitions. [2018-12-24 13:52:01,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 13:52:01,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-24 13:52:01,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:01,540 INFO L225 Difference]: With dead ends: 36 [2018-12-24 13:52:01,540 INFO L226 Difference]: Without dead ends: 35 [2018-12-24 13:52:01,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-12-24 13:52:01,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-24 13:52:01,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-12-24 13:52:01,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-24 13:52:01,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 92 transitions. [2018-12-24 13:52:01,550 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 92 transitions. Word has length 4 [2018-12-24 13:52:01,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:01,551 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 92 transitions. [2018-12-24 13:52:01,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 13:52:01,551 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 92 transitions. [2018-12-24 13:52:01,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:52:01,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:01,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:52:01,552 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:01,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:01,553 INFO L82 PathProgramCache]: Analyzing trace with hash 929616, now seen corresponding path program 1 times [2018-12-24 13:52:01,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:01,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:01,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:01,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:01,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:01,638 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 13:52:01,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:01,639 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:01,639 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:52:01,639 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [19] [2018-12-24 13:52:01,642 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:01,642 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:01,647 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:01,647 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:52:01,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:01,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:01,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:01,648 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 13:52:01,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:01,657 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:01,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:01,667 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 13:52:01,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,674 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 13:52:01,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,684 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 13:52:01,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,701 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 13:52:01,701 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:01,729 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:01,742 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:01,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:01,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 13:52:01,769 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:01,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,816 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,823 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 13:52:01,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:01,854 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 13:52:01,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:01,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:01,887 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 13:52:01,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:01,924 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 13:52:01,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:01,942 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 13:52:01,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:01,963 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 13:52:01,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:01,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:52:01,982 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:01,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:52:01,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:52:01,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:52:01,983 INFO L87 Difference]: Start difference. First operand 29 states and 92 transitions. Second operand 8 states. [2018-12-24 13:52:02,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:02,399 INFO L93 Difference]: Finished difference Result 55 states and 140 transitions. [2018-12-24 13:52:02,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:52:02,400 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-24 13:52:02,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:02,401 INFO L225 Difference]: With dead ends: 55 [2018-12-24 13:52:02,401 INFO L226 Difference]: Without dead ends: 54 [2018-12-24 13:52:02,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 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 13:52:02,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-24 13:52:02,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 34. [2018-12-24 13:52:02,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-24 13:52:02,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 117 transitions. [2018-12-24 13:52:02,413 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 117 transitions. Word has length 4 [2018-12-24 13:52:02,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:02,414 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 117 transitions. [2018-12-24 13:52:02,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:52:02,414 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 117 transitions. [2018-12-24 13:52:02,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:52:02,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:02,415 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:52:02,415 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:02,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:02,416 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2018-12-24 13:52:02,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:02,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:02,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:02,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:02,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:02,513 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 13:52:02,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:02,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:02,514 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:52:02,514 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2018-12-24 13:52:02,515 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:02,515 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:02,520 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:02,520 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:52:02,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:02,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:02,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:02,521 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 13:52:02,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:02,531 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:02,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:02,539 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 13:52:02,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:02,546 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 13:52:02,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:02,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:02,557 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 13:52:02,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:02,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:02,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:02,565 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 13:52:02,565 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:02,599 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:02,612 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:02,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:02,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 13:52:02,637 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:02,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:02,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:02,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:02,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:02,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:02,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:02,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:02,668 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 13:52:02,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:02,702 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 13:52:02,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:02,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:02,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:02,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:02,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:02,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:02,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:02,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:02,742 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:02,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:02,755 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 13:52:02,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:02,807 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 13:52:02,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:02,824 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 13:52:02,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:02,850 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 13:52:02,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:02,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:52:02,870 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:02,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:52:02,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:52:02,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:52:02,871 INFO L87 Difference]: Start difference. First operand 34 states and 117 transitions. Second operand 8 states. [2018-12-24 13:52:03,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:03,255 INFO L93 Difference]: Finished difference Result 56 states and 150 transitions. [2018-12-24 13:52:03,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:52:03,256 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-24 13:52:03,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:03,256 INFO L225 Difference]: With dead ends: 56 [2018-12-24 13:52:03,257 INFO L226 Difference]: Without dead ends: 54 [2018-12-24 13:52:03,257 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 13:52:03,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-24 13:52:03,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 36. [2018-12-24 13:52:03,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-24 13:52:03,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 127 transitions. [2018-12-24 13:52:03,266 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 127 transitions. Word has length 4 [2018-12-24 13:52:03,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:03,267 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 127 transitions. [2018-12-24 13:52:03,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:52:03,267 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 127 transitions. [2018-12-24 13:52:03,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:52:03,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:03,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:52:03,268 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:03,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:03,268 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2018-12-24 13:52:03,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:03,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:03,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:03,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:03,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:03,372 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 13:52:03,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:03,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:03,372 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:52:03,372 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [21] [2018-12-24 13:52:03,373 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:03,374 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:03,377 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:03,378 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:52:03,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:03,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:03,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:03,378 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 13:52:03,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:03,386 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:03,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:03,397 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 13:52:03,403 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 13:52:03,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:03,409 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-12-24 13:52:03,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:03,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:03,417 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 13:52:03,417 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:03,433 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:03,440 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:03,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:03,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:52:03,460 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2018-12-24 13:52:03,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:03,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:03,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:03,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:03,551 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 13:52:03,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:03,567 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 13:52:03,568 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2018-12-24 13:52:03,589 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 13:52:03,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:03,603 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 13:52:03,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:03,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 13:52:03,623 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:03,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 13:52:03,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 13:52:03,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:52:03,624 INFO L87 Difference]: Start difference. First operand 36 states and 127 transitions. Second operand 6 states. [2018-12-24 13:52:03,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:03,760 INFO L93 Difference]: Finished difference Result 48 states and 142 transitions. [2018-12-24 13:52:03,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 13:52:03,769 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-24 13:52:03,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:03,770 INFO L225 Difference]: With dead ends: 48 [2018-12-24 13:52:03,770 INFO L226 Difference]: Without dead ends: 47 [2018-12-24 13:52:03,770 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 13:52:03,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-24 13:52:03,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2018-12-24 13:52:03,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-24 13:52:03,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 127 transitions. [2018-12-24 13:52:03,779 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 127 transitions. Word has length 4 [2018-12-24 13:52:03,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:03,780 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 127 transitions. [2018-12-24 13:52:03,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 13:52:03,780 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 127 transitions. [2018-12-24 13:52:03,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:52:03,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:03,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:52:03,781 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:03,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:03,781 INFO L82 PathProgramCache]: Analyzing trace with hash 29112214, now seen corresponding path program 1 times [2018-12-24 13:52:03,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:03,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:03,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:03,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:03,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:03,917 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 13:52:03,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:03,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:03,918 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:52:03,918 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [21] [2018-12-24 13:52:03,922 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:03,922 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:03,926 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:03,926 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:52:03,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:03,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:03,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:03,927 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 13:52:03,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:03,947 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:03,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:03,972 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 13:52:03,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:03,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, 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 13:52:03,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:03,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:03,986 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 13:52:03,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:03,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:03,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:03,994 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 13:52:03,995 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:04,024 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:04,034 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:04,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:04,057 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 13:52:04,058 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:04,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,080 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 13:52:04,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:04,108 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 13:52:04,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:04,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,132 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,141 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 13:52:04,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:04,173 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 13:52:04,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:04,189 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 13:52:04,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:04,313 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 13:52:04,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:04,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:52:04,333 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:04,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:52:04,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:52:04,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:52:04,334 INFO L87 Difference]: Start difference. First operand 36 states and 127 transitions. Second operand 8 states. [2018-12-24 13:52:04,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:04,612 INFO L93 Difference]: Finished difference Result 56 states and 161 transitions. [2018-12-24 13:52:04,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:52:04,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 13:52:04,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:04,614 INFO L225 Difference]: With dead ends: 56 [2018-12-24 13:52:04,614 INFO L226 Difference]: Without dead ends: 55 [2018-12-24 13:52:04,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:52:04,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-24 13:52:04,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2018-12-24 13:52:04,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-24 13:52:04,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 142 transitions. [2018-12-24 13:52:04,625 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 142 transitions. Word has length 5 [2018-12-24 13:52:04,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:04,626 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 142 transitions. [2018-12-24 13:52:04,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:52:04,626 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 142 transitions. [2018-12-24 13:52:04,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:52:04,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:04,628 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:52:04,629 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:04,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:04,629 INFO L82 PathProgramCache]: Analyzing trace with hash 29111902, now seen corresponding path program 1 times [2018-12-24 13:52:04,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:04,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:04,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:04,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:04,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:04,774 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 13:52:04,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:04,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:04,775 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:52:04,775 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2018-12-24 13:52:04,776 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:04,776 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:04,781 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:04,782 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 13:52:04,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:04,782 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:04,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:04,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 13:52:04,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:04,795 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:04,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:04,808 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 13:52:04,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,812 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 13:52:04,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,818 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 13:52:04,823 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,825 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,827 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 13:52:04,828 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:04,850 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:04,859 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:04,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:04,880 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 13:52:04,881 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:04,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,927 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 13:52:04,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:04,959 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 13:52:04,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:04,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,989 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:04,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 13:52:04,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:05,030 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 13:52:05,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:05,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:05,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:05,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:05,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:05,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:05,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:05,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:05,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:05,071 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:05,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:05,074 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 13:52:05,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:05,108 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 13:52:05,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2018-12-24 13:52:05,125 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 13:52:05,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:05,165 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 13:52:05,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:05,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:52:05,185 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:05,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:52:05,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:52:05,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:52:05,186 INFO L87 Difference]: Start difference. First operand 39 states and 142 transitions. Second operand 10 states. [2018-12-24 13:52:05,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:05,740 INFO L93 Difference]: Finished difference Result 76 states and 212 transitions. [2018-12-24 13:52:05,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:52:05,741 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-12-24 13:52:05,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:05,742 INFO L225 Difference]: With dead ends: 76 [2018-12-24 13:52:05,742 INFO L226 Difference]: Without dead ends: 75 [2018-12-24 13:52:05,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:52:05,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-24 13:52:05,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 41. [2018-12-24 13:52:05,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-24 13:52:05,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2018-12-24 13:52:05,755 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2018-12-24 13:52:05,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:05,755 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2018-12-24 13:52:05,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:52:05,756 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2018-12-24 13:52:05,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:52:05,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:05,756 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:52:05,757 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:05,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:05,757 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2018-12-24 13:52:05,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:05,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:05,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:05,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:05,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:05,933 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 13:52:05,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:05,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:05,934 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:52:05,934 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2018-12-24 13:52:05,935 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:05,935 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:05,940 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:05,940 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 13:52:05,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:05,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:05,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:05,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 13:52:05,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:05,954 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:05,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:05,962 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 13:52:05,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:05,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 13:52:05,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:05,973 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:05,973 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 13:52:05,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:05,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:05,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:05,984 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 13:52:05,985 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:06,013 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:06,028 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:06,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:06,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:06,049 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:06,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:06,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:06,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:06,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:06,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:06,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:06,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:06,122 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 13:52:06,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:06,149 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 13:52:06,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:06,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:06,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:06,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:06,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:06,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:06,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:06,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:06,226 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:06,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2018-12-24 13:52:06,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:06,266 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 13:52:06,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2018-12-24 13:52:06,485 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-24 13:52:06,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:06,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:06,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:06,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:06,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:06,551 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:06,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:06,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:06,557 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:06,558 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 13:52:06,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:06,606 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 13:52:06,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2018-12-24 13:52:06,631 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 13:52:06,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:06,680 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 13:52:06,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:06,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:52:06,700 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:06,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:52:06,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:52:06,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:52:06,701 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 10 states. [2018-12-24 13:52:07,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:07,248 INFO L93 Difference]: Finished difference Result 67 states and 187 transitions. [2018-12-24 13:52:07,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:52:07,249 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-12-24 13:52:07,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:07,250 INFO L225 Difference]: With dead ends: 67 [2018-12-24 13:52:07,250 INFO L226 Difference]: Without dead ends: 65 [2018-12-24 13:52:07,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:52:07,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-24 13:52:07,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2018-12-24 13:52:07,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-24 13:52:07,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 142 transitions. [2018-12-24 13:52:07,261 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 142 transitions. Word has length 5 [2018-12-24 13:52:07,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:07,262 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 142 transitions. [2018-12-24 13:52:07,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:52:07,262 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 142 transitions. [2018-12-24 13:52:07,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:52:07,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:07,263 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:52:07,263 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:07,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:07,263 INFO L82 PathProgramCache]: Analyzing trace with hash 29119902, now seen corresponding path program 1 times [2018-12-24 13:52:07,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:07,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:07,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:07,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:07,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:07,357 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 13:52:07,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:07,357 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:07,357 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:52:07,358 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [21] [2018-12-24 13:52:07,360 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:07,360 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:07,365 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:07,365 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:52:07,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:07,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:07,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:07,366 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 13:52:07,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:07,376 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:07,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:07,414 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 13:52:07,439 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 13:52:07,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:07,444 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-12-24 13:52:07,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:07,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:07,451 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 13:52:07,452 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:07,469 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:07,476 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:07,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:07,494 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 13:52:07,494 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2018-12-24 13:52:07,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:07,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:07,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:07,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:07,524 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 13:52:07,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:07,540 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 13:52:07,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-24 13:52:07,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:07,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:07,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:07,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:07,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:07,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:07,566 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 13:52:07,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:07,592 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 13:52:07,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2018-12-24 13:52:07,607 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 13:52:07,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:07,632 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 13:52:07,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:07,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:52:07,651 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:07,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:52:07,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:52:07,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:52:07,652 INFO L87 Difference]: Start difference. First operand 39 states and 142 transitions. Second operand 8 states. [2018-12-24 13:52:07,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:07,862 INFO L93 Difference]: Finished difference Result 58 states and 171 transitions. [2018-12-24 13:52:07,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:52:07,862 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 13:52:07,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:07,864 INFO L225 Difference]: With dead ends: 58 [2018-12-24 13:52:07,864 INFO L226 Difference]: Without dead ends: 57 [2018-12-24 13:52:07,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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 13:52:07,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-24 13:52:07,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2018-12-24 13:52:07,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-24 13:52:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2018-12-24 13:52:07,875 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2018-12-24 13:52:07,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:07,875 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2018-12-24 13:52:07,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:52:07,876 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2018-12-24 13:52:07,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:52:07,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:07,876 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:52:07,877 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:07,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:07,877 INFO L82 PathProgramCache]: Analyzing trace with hash 28823602, now seen corresponding path program 2 times [2018-12-24 13:52:07,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:07,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:07,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:07,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:07,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:08,018 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 13:52:08,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:08,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:08,019 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:08,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:08,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:08,019 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 13:52:08,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:52:08,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:52:08,037 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:52:08,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:52:08,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:08,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, 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 13:52:08,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,048 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 13:52:08,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,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 13:52:08,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,075 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 13:52:08,075 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:08,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:08,110 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:08,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:08,134 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 13:52:08,134 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:08,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,166 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 13:52:08,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:08,210 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 13:52:08,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:08,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,257 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 13:52:08,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:08,284 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 13:52:08,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:08,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,311 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,313 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:08,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:08,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, 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 13:52:08,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:08,390 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 13:52:08,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2018-12-24 13:52:08,406 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 13:52:08,407 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:08,445 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 13:52:08,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:08,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:52:08,465 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:08,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:52:08,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:52:08,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:52:08,465 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 10 states. [2018-12-24 13:52:08,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:08,877 INFO L93 Difference]: Finished difference Result 71 states and 199 transitions. [2018-12-24 13:52:08,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:52:08,878 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-12-24 13:52:08,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:08,879 INFO L225 Difference]: With dead ends: 71 [2018-12-24 13:52:08,880 INFO L226 Difference]: Without dead ends: 70 [2018-12-24 13:52:08,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:52:08,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-24 13:52:08,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 30. [2018-12-24 13:52:08,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-24 13:52:08,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2018-12-24 13:52:08,892 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 5 [2018-12-24 13:52:08,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:08,892 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2018-12-24 13:52:08,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:52:08,893 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2018-12-24 13:52:08,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:52:08,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:08,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:52:08,894 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:08,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:08,894 INFO L82 PathProgramCache]: Analyzing trace with hash 28827822, now seen corresponding path program 1 times [2018-12-24 13:52:08,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:08,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:08,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:52:08,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:08,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:08,966 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 13:52:08,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 13:52:08,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-24 13:52:08,967 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:52:08,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 13:52:08,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 13:52:08,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-24 13:52:08,968 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 4 states. [2018-12-24 13:52:09,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:09,179 INFO L93 Difference]: Finished difference Result 36 states and 106 transitions. [2018-12-24 13:52:09,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:52:09,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-24 13:52:09,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:09,180 INFO L225 Difference]: With dead ends: 36 [2018-12-24 13:52:09,180 INFO L226 Difference]: Without dead ends: 33 [2018-12-24 13:52:09,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 13:52:09,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-24 13:52:09,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-12-24 13:52:09,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-24 13:52:09,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 99 transitions. [2018-12-24 13:52:09,192 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 99 transitions. Word has length 5 [2018-12-24 13:52:09,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:09,193 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 99 transitions. [2018-12-24 13:52:09,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 13:52:09,193 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 99 transitions. [2018-12-24 13:52:09,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:52:09,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:09,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:52:09,194 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:09,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:09,194 INFO L82 PathProgramCache]: Analyzing trace with hash 28818148, now seen corresponding path program 1 times [2018-12-24 13:52:09,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:09,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:09,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:09,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:09,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:09,343 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-12-24 13:52:09,361 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 13:52:09,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:09,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:09,362 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:52:09,363 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [21] [2018-12-24 13:52:09,364 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:09,364 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:09,367 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:09,368 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:52:09,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:09,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:09,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:09,368 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 13:52:09,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:09,383 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:09,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:09,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 13:52:09,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:09,399 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 13:52:09,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:09,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:09,413 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 13:52:09,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:09,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:09,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:09,424 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 13:52:09,425 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:09,442 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:09,455 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:09,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:09,481 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 13:52:09,482 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:09,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:09,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:09,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:09,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:09,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:09,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:09,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:09,508 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 13:52:09,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:09,560 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 13:52:09,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:09,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:09,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:09,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:09,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:09,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:09,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:09,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:09,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:09,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:09,595 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 13:52:09,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:09,990 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 13:52:09,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:10,091 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 13:52:10,091 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:10,107 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 13:52:10,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:10,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2018-12-24 13:52:10,128 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:10,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:52:10,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:52:10,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:52:10,129 INFO L87 Difference]: Start difference. First operand 29 states and 99 transitions. Second operand 8 states. [2018-12-24 13:52:10,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:10,316 INFO L93 Difference]: Finished difference Result 44 states and 125 transitions. [2018-12-24 13:52:10,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:52:10,323 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 13:52:10,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:10,324 INFO L225 Difference]: With dead ends: 44 [2018-12-24 13:52:10,324 INFO L226 Difference]: Without dead ends: 43 [2018-12-24 13:52:10,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 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 13:52:10,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-24 13:52:10,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2018-12-24 13:52:10,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-24 13:52:10,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 114 transitions. [2018-12-24 13:52:10,336 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 114 transitions. Word has length 5 [2018-12-24 13:52:10,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:10,336 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 114 transitions. [2018-12-24 13:52:10,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:52:10,336 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 114 transitions. [2018-12-24 13:52:10,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:52:10,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:10,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:52:10,337 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:10,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:10,337 INFO L82 PathProgramCache]: Analyzing trace with hash 28821992, now seen corresponding path program 1 times [2018-12-24 13:52:10,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:10,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:10,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:10,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:10,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:10,593 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2018-12-24 13:52:10,617 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 13:52:10,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:10,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:10,618 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:52:10,618 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [21] [2018-12-24 13:52:10,620 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:10,620 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:10,623 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:10,623 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:52:10,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:10,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:10,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:10,624 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 13:52:10,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:10,633 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:10,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:10,641 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 13:52:10,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:10,651 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 13:52:10,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:10,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:10,659 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 13:52:10,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:10,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:10,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:10,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 13:52:10,674 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:10,695 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:10,703 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:10,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:10,725 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 13:52:10,726 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:10,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:10,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:10,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:10,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:10,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:10,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:10,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:10,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 51 [2018-12-24 13:52:10,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:10,788 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 13:52:10,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:10,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:10,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:10,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:10,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:10,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:10,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:10,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:10,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:10,835 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:10,836 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 13:52:10,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:10,866 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 13:52:10,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:10,887 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 13:52:10,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:10,918 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 13:52:10,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:10,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:52:10,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:10,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:52:10,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:52:10,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:52:10,937 INFO L87 Difference]: Start difference. First operand 32 states and 114 transitions. Second operand 8 states. [2018-12-24 13:52:11,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:11,230 INFO L93 Difference]: Finished difference Result 49 states and 142 transitions. [2018-12-24 13:52:11,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:52:11,231 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 13:52:11,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:11,232 INFO L225 Difference]: With dead ends: 49 [2018-12-24 13:52:11,232 INFO L226 Difference]: Without dead ends: 48 [2018-12-24 13:52:11,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:52:11,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-24 13:52:11,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2018-12-24 13:52:11,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-24 13:52:11,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 124 transitions. [2018-12-24 13:52:11,245 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 124 transitions. Word has length 5 [2018-12-24 13:52:11,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:11,245 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 124 transitions. [2018-12-24 13:52:11,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:52:11,246 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 124 transitions. [2018-12-24 13:52:11,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:52:11,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:11,246 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:52:11,246 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:11,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:11,247 INFO L82 PathProgramCache]: Analyzing trace with hash 28933468, now seen corresponding path program 2 times [2018-12-24 13:52:11,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:11,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:11,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:11,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:11,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:11,492 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2018-12-24 13:52:11,503 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 13:52:11,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:11,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:11,503 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:11,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:11,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:11,504 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 13:52:11,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:52:11,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:52:11,517 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-24 13:52:11,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:52:11,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:11,521 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 13:52:11,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:11,524 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 13:52:11,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:11,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:11,530 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 13:52:11,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:11,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:11,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:11,543 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 13:52:11,544 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:11,560 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:11,568 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:11,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:11,588 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 13:52:11,588 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:11,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:11,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:11,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:11,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:11,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:11,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:11,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:11,781 INFO L303 Elim1Store]: Index analysis took 177 ms [2018-12-24 13:52:11,781 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 13:52:11,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:12,159 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 13:52:12,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:12,367 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-24 13:52:12,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:12,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:12,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:12,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:12,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:12,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:12,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:12,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:12,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:12,594 INFO L303 Elim1Store]: Index analysis took 224 ms [2018-12-24 13:52:12,595 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 13:52:12,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:12,988 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 13:52:12,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:13,123 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 13:52:13,123 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:13,142 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 13:52:13,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:13,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:52:13,162 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:13,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:52:13,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:52:13,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:52:13,163 INFO L87 Difference]: Start difference. First operand 34 states and 124 transitions. Second operand 8 states. [2018-12-24 13:52:13,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:13,733 INFO L93 Difference]: Finished difference Result 58 states and 161 transitions. [2018-12-24 13:52:13,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:52:13,734 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 13:52:13,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:13,736 INFO L225 Difference]: With dead ends: 58 [2018-12-24 13:52:13,736 INFO L226 Difference]: Without dead ends: 57 [2018-12-24 13:52:13,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:52:13,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-24 13:52:13,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2018-12-24 13:52:13,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-24 13:52:13,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 134 transitions. [2018-12-24 13:52:13,753 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 134 transitions. Word has length 5 [2018-12-24 13:52:13,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:13,754 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 134 transitions. [2018-12-24 13:52:13,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:52:13,754 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 134 transitions. [2018-12-24 13:52:13,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:52:13,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:13,754 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:52:13,755 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:13,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:13,755 INFO L82 PathProgramCache]: Analyzing trace with hash 28941156, now seen corresponding path program 1 times [2018-12-24 13:52:13,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:13,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:13,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:52:13,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:13,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:13,890 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 13:52:13,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:13,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:13,890 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:52:13,891 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [21] [2018-12-24 13:52:13,892 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:13,892 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:13,895 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:13,895 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:52:13,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:13,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:13,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:13,896 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 13:52:13,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:13,906 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:13,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:13,913 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 13:52:13,918 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 13:52:13,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:13,924 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-12-24 13:52:13,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:13,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:13,936 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 13:52:13,937 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:13,948 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:13,956 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:13,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:13,974 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 13:52:13,974 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2018-12-24 13:52:14,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:14,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:14,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:14,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:14,013 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 13:52:14,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:14,028 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 13:52:14,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-24 13:52:14,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:14,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:14,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:14,075 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:14,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:14,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:14,077 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 13:52:14,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:14,095 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 13:52:14,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2018-12-24 13:52:14,109 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 13:52:14,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:14,128 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 13:52:14,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:14,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:52:14,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:14,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:52:14,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:52:14,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:52:14,148 INFO L87 Difference]: Start difference. First operand 36 states and 134 transitions. Second operand 8 states. [2018-12-24 13:52:14,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:14,394 INFO L93 Difference]: Finished difference Result 59 states and 162 transitions. [2018-12-24 13:52:14,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:52:14,394 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 13:52:14,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:14,395 INFO L225 Difference]: With dead ends: 59 [2018-12-24 13:52:14,395 INFO L226 Difference]: Without dead ends: 58 [2018-12-24 13:52:14,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:52:14,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-24 13:52:14,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 37. [2018-12-24 13:52:14,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-24 13:52:14,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 139 transitions. [2018-12-24 13:52:14,407 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 139 transitions. Word has length 5 [2018-12-24 13:52:14,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:14,408 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 139 transitions. [2018-12-24 13:52:14,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:52:14,408 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 139 transitions. [2018-12-24 13:52:14,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:52:14,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:14,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:52:14,409 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:14,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:14,409 INFO L82 PathProgramCache]: Analyzing trace with hash 29066150, now seen corresponding path program 1 times [2018-12-24 13:52:14,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:14,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:14,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:14,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:14,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:14,439 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 13:52:14,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:14,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:14,439 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:52:14,440 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [22], [23] [2018-12-24 13:52:14,440 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:14,441 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:14,444 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:14,445 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:52:14,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:14,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:14,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:14,445 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 13:52:14,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:14,454 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:14,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:14,462 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 13:52:14,466 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 13:52:14,481 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 13:52:14,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:14,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-24 13:52:14,501 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:14,510 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:14,518 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:14,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:14,537 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 13:52:14,537 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:19, output treesize:24 [2018-12-24 13:52:14,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:14,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:14,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 13:52:14,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:14,562 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 13:52:14,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2018-12-24 13:52:14,571 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 13:52:14,571 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:14,576 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 13:52:14,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-24 13:52:14,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2018-12-24 13:52:14,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:52:14,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 13:52:14,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 13:52:14,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-24 13:52:14,597 INFO L87 Difference]: Start difference. First operand 37 states and 139 transitions. Second operand 4 states. [2018-12-24 13:52:14,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:14,913 INFO L93 Difference]: Finished difference Result 74 states and 262 transitions. [2018-12-24 13:52:14,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-24 13:52:14,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-24 13:52:14,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:14,914 INFO L225 Difference]: With dead ends: 74 [2018-12-24 13:52:14,914 INFO L226 Difference]: Without dead ends: 73 [2018-12-24 13:52:14,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-24 13:52:14,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-24 13:52:14,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2018-12-24 13:52:14,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-24 13:52:14,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 250 transitions. [2018-12-24 13:52:14,932 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 250 transitions. Word has length 5 [2018-12-24 13:52:14,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:14,932 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 250 transitions. [2018-12-24 13:52:14,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 13:52:14,933 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 250 transitions. [2018-12-24 13:52:14,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:52:14,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:14,933 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:52:14,933 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:14,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:14,934 INFO L82 PathProgramCache]: Analyzing trace with hash 29052506, now seen corresponding path program 1 times [2018-12-24 13:52:14,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:14,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:14,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:14,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:14,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:15,262 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-24 13:52:15,294 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 13:52:15,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:15,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:15,294 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:52:15,295 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2018-12-24 13:52:15,295 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:15,295 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:15,299 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:15,299 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 13:52:15,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:15,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:15,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:15,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 13:52:15,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:15,311 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:15,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:15,319 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 13:52:15,322 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,322 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 13:52:15,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,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, 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 13:52:15,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,345 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,345 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 13:52:15,346 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:15,365 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:15,374 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:15,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:15,394 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 13:52:15,395 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:15,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,417 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,420 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 13:52:15,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:15,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 13:52:15,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:15,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,472 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:15,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2018-12-24 13:52:15,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:15,666 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 13:52:15,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:15,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:15,696 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 13:52:15,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:15,726 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 13:52:15,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:15,743 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 13:52:15,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:15,774 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 13:52:15,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:15,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-24 13:52:15,793 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:15,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:52:15,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:52:15,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:52:15,794 INFO L87 Difference]: Start difference. First operand 59 states and 250 transitions. Second operand 10 states. [2018-12-24 13:52:16,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:16,239 INFO L93 Difference]: Finished difference Result 105 states and 359 transitions. [2018-12-24 13:52:16,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:52:16,240 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-12-24 13:52:16,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:16,241 INFO L225 Difference]: With dead ends: 105 [2018-12-24 13:52:16,241 INFO L226 Difference]: Without dead ends: 97 [2018-12-24 13:52:16,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-12-24 13:52:16,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-24 13:52:16,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 71. [2018-12-24 13:52:16,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-24 13:52:16,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 308 transitions. [2018-12-24 13:52:16,264 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 308 transitions. Word has length 5 [2018-12-24 13:52:16,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:16,264 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 308 transitions. [2018-12-24 13:52:16,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:52:16,264 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 308 transitions. [2018-12-24 13:52:16,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:52:16,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:16,265 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-24 13:52:16,265 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:16,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:16,265 INFO L82 PathProgramCache]: Analyzing trace with hash 902776598, now seen corresponding path program 1 times [2018-12-24 13:52:16,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:16,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:16,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:16,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:16,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:16,314 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 13:52:16,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:16,315 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:16,315 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:52:16,316 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [22], [23] [2018-12-24 13:52:16,317 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:16,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:16,320 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:16,320 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:52:16,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:16,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:16,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:16,321 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 13:52:16,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:16,335 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:16,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:16,343 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 13:52:16,349 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 13:52:16,362 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 13:52:16,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:16,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-24 13:52:16,403 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:16,414 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:16,422 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:16,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:16,438 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 13:52:16,439 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2018-12-24 13:52:16,719 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2018-12-24 13:52:16,763 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:16,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:16,792 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 15 [2018-12-24 13:52:16,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:16,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:16,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-12-24 13:52:16,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:16,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:16,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:16,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:16,822 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 23 treesize of output 27 [2018-12-24 13:52:16,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:16,831 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 13:52:16,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:14 [2018-12-24 13:52:16,849 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 13:52:16,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:16,904 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 13:52:16,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:16,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2018-12-24 13:52:16,924 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:16,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-24 13:52:16,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-24 13:52:16,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:52:16,925 INFO L87 Difference]: Start difference. First operand 71 states and 308 transitions. Second operand 7 states. [2018-12-24 13:52:17,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:17,070 INFO L93 Difference]: Finished difference Result 85 states and 324 transitions. [2018-12-24 13:52:17,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:52:17,071 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-12-24 13:52:17,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:17,072 INFO L225 Difference]: With dead ends: 85 [2018-12-24 13:52:17,072 INFO L226 Difference]: Without dead ends: 80 [2018-12-24 13:52:17,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:52:17,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-24 13:52:17,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2018-12-24 13:52:17,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-24 13:52:17,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2018-12-24 13:52:17,095 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2018-12-24 13:52:17,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:17,096 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2018-12-24 13:52:17,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-24 13:52:17,096 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2018-12-24 13:52:17,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:52:17,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:17,097 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:52:17,097 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:17,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:17,097 INFO L82 PathProgramCache]: Analyzing trace with hash 902478688, now seen corresponding path program 1 times [2018-12-24 13:52:17,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:17,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:17,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:17,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:17,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:17,206 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 13:52:17,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:17,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:17,207 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:52:17,207 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [23] [2018-12-24 13:52:17,208 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:17,209 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:17,212 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:17,212 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:52:17,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:17,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:17,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:17,213 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 13:52:17,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:17,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:17,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:17,229 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 13:52:17,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:17,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 13:52:17,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:17,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:17,244 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 13:52:17,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:17,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:17,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:17,252 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 13:52:17,253 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:17,322 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:17,340 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:17,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:17,363 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 13:52:17,363 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:17,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:17,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:17,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:17,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:17,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:17,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:17,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:17,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2018-12-24 13:52:17,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:17,473 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 13:52:17,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:17,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:17,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:17,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:17,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:17,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:17,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:17,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:17,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:17,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:17,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, 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 13:52:17,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:17,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:52:17,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:17,561 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 13:52:17,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:17,582 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 13:52:17,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:17,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:52:17,601 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:17,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:52:17,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:52:17,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:52:17,602 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 8 states. [2018-12-24 13:52:17,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:17,829 INFO L93 Difference]: Finished difference Result 83 states and 322 transitions. [2018-12-24 13:52:17,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:52:17,829 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2018-12-24 13:52:17,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:17,831 INFO L225 Difference]: With dead ends: 83 [2018-12-24 13:52:17,831 INFO L226 Difference]: Without dead ends: 82 [2018-12-24 13:52:17,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 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 13:52:17,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-24 13:52:17,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 71. [2018-12-24 13:52:17,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-24 13:52:17,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2018-12-24 13:52:17,854 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2018-12-24 13:52:17,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:17,854 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2018-12-24 13:52:17,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:52:17,854 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2018-12-24 13:52:17,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:52:17,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:17,855 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:52:17,855 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:17,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:17,855 INFO L82 PathProgramCache]: Analyzing trace with hash 902469014, now seen corresponding path program 1 times [2018-12-24 13:52:17,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:17,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:17,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:17,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:17,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:17,964 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 13:52:17,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:17,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:17,965 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:52:17,965 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [21] [2018-12-24 13:52:17,967 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:17,967 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:17,970 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:17,970 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 13:52:17,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:17,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:17,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:17,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 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 13:52:17,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:17,990 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:18,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:18,007 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 13:52:18,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,011 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 13:52:18,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,021 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 13:52:18,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:52:18,036 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:18,061 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:18,070 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:18,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:18,094 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 13:52:18,095 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:18,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,125 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 13:52:18,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:18,154 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 13:52:18,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:18,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,204 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 13:52:18,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:18,242 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 13:52:18,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:18,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,273 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:18,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:18,276 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 13:52:18,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:18,315 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 13:52:18,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2018-12-24 13:52:18,337 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 13:52:18,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:18,409 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 13:52:18,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:18,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-24 13:52:18,429 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:18,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:52:18,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:52:18,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:52:18,430 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 10 states. [2018-12-24 13:52:18,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:18,841 INFO L93 Difference]: Finished difference Result 97 states and 346 transitions. [2018-12-24 13:52:18,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:52:18,842 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-24 13:52:18,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:18,843 INFO L225 Difference]: With dead ends: 97 [2018-12-24 13:52:18,843 INFO L226 Difference]: Without dead ends: 96 [2018-12-24 13:52:18,844 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 13:52:18,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-24 13:52:18,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2018-12-24 13:52:18,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-24 13:52:18,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2018-12-24 13:52:18,869 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2018-12-24 13:52:18,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:18,869 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2018-12-24 13:52:18,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:52:18,869 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2018-12-24 13:52:18,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:52:18,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:18,870 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:52:18,871 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:18,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:18,871 INFO L82 PathProgramCache]: Analyzing trace with hash 902472858, now seen corresponding path program 1 times [2018-12-24 13:52:18,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:18,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:18,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:18,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:18,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:19,040 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 13:52:19,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:19,041 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:19,041 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:52:19,041 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [21] [2018-12-24 13:52:19,042 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:19,043 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:19,046 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:19,046 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 13:52:19,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:19,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:19,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:19,047 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 13:52:19,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:19,067 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:19,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:19,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:19,078 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 13:52:19,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,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 13:52:19,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,092 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 13:52:19,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,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 13:52:19,101 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:19,120 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:19,128 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:19,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:19,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:19,146 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:19,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,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, 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 13:52:19,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:19,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:52:19,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:19,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,230 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,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, 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 13:52:19,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:19,267 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 13:52:19,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:19,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,297 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:19,302 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:19,303 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 13:52:19,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:19,335 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 13:52:19,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:19,356 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 13:52:19,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:19,400 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 13:52:19,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:19,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:52:19,419 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:19,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:52:19,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:52:19,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:52:19,420 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 10 states. [2018-12-24 13:52:19,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:19,803 INFO L93 Difference]: Finished difference Result 102 states and 389 transitions. [2018-12-24 13:52:19,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:52:19,803 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-24 13:52:19,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:19,805 INFO L225 Difference]: With dead ends: 102 [2018-12-24 13:52:19,805 INFO L226 Difference]: Without dead ends: 101 [2018-12-24 13:52:19,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:52:19,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-24 13:52:19,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2018-12-24 13:52:19,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-24 13:52:19,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 357 transitions. [2018-12-24 13:52:19,834 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 357 transitions. Word has length 6 [2018-12-24 13:52:19,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:19,834 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 357 transitions. [2018-12-24 13:52:19,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:52:19,834 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 357 transitions. [2018-12-24 13:52:19,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:52:19,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:19,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:52:19,835 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:19,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:19,836 INFO L82 PathProgramCache]: Analyzing trace with hash 902592022, now seen corresponding path program 1 times [2018-12-24 13:52:19,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:19,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:19,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:19,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:19,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:20,085 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2018-12-24 13:52:20,130 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 13:52:20,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:20,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:20,131 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:52:20,131 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [21] [2018-12-24 13:52:20,132 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:20,133 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:20,135 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:20,136 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 13:52:20,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:20,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:20,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:20,136 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 13:52:20,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:20,145 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:20,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:20,153 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 13:52:20,158 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 13:52:20,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:20,191 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-12-24 13:52:20,204 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:20,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:20,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2018-12-24 13:52:20,209 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:20,222 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:20,230 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:20,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:20,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:52:20,250 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2018-12-24 13:52:20,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:20,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:20,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:20,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:20,282 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 13:52:20,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:20,296 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 13:52:20,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-24 13:52:20,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:20,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:20,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:20,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:20,320 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:20,321 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 13:52:20,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:20,337 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 13:52:20,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:22 [2018-12-24 13:52:20,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:20,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:20,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:20,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:20,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:20,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:20,364 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 44 [2018-12-24 13:52:20,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:20,382 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 13:52:20,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2018-12-24 13:52:20,396 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 13:52:20,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:20,432 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 13:52:20,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:20,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:52:20,451 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:20,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:52:20,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:52:20,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:52:20,452 INFO L87 Difference]: Start difference. First operand 81 states and 357 transitions. Second operand 10 states. [2018-12-24 13:52:20,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:20,887 INFO L93 Difference]: Finished difference Result 108 states and 386 transitions. [2018-12-24 13:52:20,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:52:20,887 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-24 13:52:20,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:20,889 INFO L225 Difference]: With dead ends: 108 [2018-12-24 13:52:20,889 INFO L226 Difference]: Without dead ends: 107 [2018-12-24 13:52:20,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:52:20,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-24 13:52:20,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 77. [2018-12-24 13:52:20,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-24 13:52:20,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 337 transitions. [2018-12-24 13:52:20,913 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 337 transitions. Word has length 6 [2018-12-24 13:52:20,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:20,913 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 337 transitions. [2018-12-24 13:52:20,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:52:20,913 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 337 transitions. [2018-12-24 13:52:20,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:52:20,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:20,914 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:52:20,914 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:20,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:20,915 INFO L82 PathProgramCache]: Analyzing trace with hash 902591586, now seen corresponding path program 1 times [2018-12-24 13:52:20,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:20,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:20,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:20,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:20,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:21,057 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 13:52:21,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:21,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:21,058 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:52:21,058 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2018-12-24 13:52:21,059 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:21,059 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:21,061 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:21,061 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-24 13:52:21,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:21,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:21,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:21,062 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 13:52:21,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:21,070 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:21,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:21,079 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 13:52:21,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,086 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 13:52:21,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,092 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 13:52:21,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,100 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 13:52:21,101 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:21,118 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:21,128 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:21,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:21,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:21,148 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:21,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,176 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 13:52:21,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:21,201 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 13:52:21,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:21,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,230 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:21,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2018-12-24 13:52:21,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:21,260 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 13:52:21,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2018-12-24 13:52:21,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,292 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 13:52:21,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:21,324 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 13:52:21,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2018-12-24 13:52:21,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:21,358 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:21,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, 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 13:52:21,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:21,400 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 13:52:21,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2018-12-24 13:52:21,485 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 13:52:21,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:21,590 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 13:52:21,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:21,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2018-12-24 13:52:21,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:21,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:52:21,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:52:21,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:52:21,612 INFO L87 Difference]: Start difference. First operand 77 states and 337 transitions. Second operand 12 states. [2018-12-24 13:52:22,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:22,942 INFO L93 Difference]: Finished difference Result 120 states and 459 transitions. [2018-12-24 13:52:22,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:52:22,942 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2018-12-24 13:52:22,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:22,945 INFO L225 Difference]: With dead ends: 120 [2018-12-24 13:52:22,949 INFO L226 Difference]: Without dead ends: 119 [2018-12-24 13:52:22,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2018-12-24 13:52:22,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-24 13:52:22,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 82. [2018-12-24 13:52:22,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-24 13:52:22,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 362 transitions. [2018-12-24 13:52:22,975 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 362 transitions. Word has length 6 [2018-12-24 13:52:22,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:22,975 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 362 transitions. [2018-12-24 13:52:22,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:52:22,975 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 362 transitions. [2018-12-24 13:52:22,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:52:22,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:22,976 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:52:22,976 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:22,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:22,976 INFO L82 PathProgramCache]: Analyzing trace with hash 902703186, now seen corresponding path program 2 times [2018-12-24 13:52:22,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:22,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:22,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:22,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:22,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:23,701 WARN L181 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2018-12-24 13:52:23,780 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 13:52:23,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:23,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:23,780 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:23,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:23,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:23,781 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 13:52:23,792 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:52:23,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:52:23,798 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:52:23,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:52:23,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:23,802 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 13:52:23,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:23,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, 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 13:52:23,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:23,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:23,809 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 13:52:23,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:23,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:23,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:23,816 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 13:52:23,817 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:23,834 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:23,844 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:23,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:23,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:23,866 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:23,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:23,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:23,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:23,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:23,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:23,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:23,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:23,904 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 13:52:23,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:23,932 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 13:52:23,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:23,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:23,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:23,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:23,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:23,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:23,961 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:23,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:23,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:23,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:23,965 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 13:52:23,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:23,996 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 13:52:23,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:24,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:24,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:24,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:24,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:24,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:24,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:24,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:24,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:24,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:24,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:24,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:24,049 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:24,050 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 13:52:24,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:24,083 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 13:52:24,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:24,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:24,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:24,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:24,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:24,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:24,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:24,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:24,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:24,115 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:24,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:24,117 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 13:52:24,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:24,149 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 13:52:24,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2018-12-24 13:52:24,166 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 13:52:24,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:24,232 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 13:52:24,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:24,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-24 13:52:24,252 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:24,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:52:24,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:52:24,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:52:24,255 INFO L87 Difference]: Start difference. First operand 82 states and 362 transitions. Second operand 12 states. [2018-12-24 13:52:24,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:24,833 INFO L93 Difference]: Finished difference Result 146 states and 556 transitions. [2018-12-24 13:52:24,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:52:24,833 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2018-12-24 13:52:24,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:24,835 INFO L225 Difference]: With dead ends: 146 [2018-12-24 13:52:24,836 INFO L226 Difference]: Without dead ends: 145 [2018-12-24 13:52:24,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2018-12-24 13:52:24,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-24 13:52:24,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 98. [2018-12-24 13:52:24,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-24 13:52:24,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 442 transitions. [2018-12-24 13:52:24,862 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 442 transitions. Word has length 6 [2018-12-24 13:52:24,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:24,862 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 442 transitions. [2018-12-24 13:52:24,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:52:24,863 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 442 transitions. [2018-12-24 13:52:24,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:52:24,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:24,863 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:52:24,864 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:24,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:24,864 INFO L82 PathProgramCache]: Analyzing trace with hash 893362642, now seen corresponding path program 1 times [2018-12-24 13:52:24,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:24,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:24,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:52:24,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:24,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:24,960 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 13:52:24,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:24,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:24,961 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:52:24,961 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [23] [2018-12-24 13:52:24,962 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:24,962 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:24,964 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:24,964 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:52:24,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:24,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:24,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:24,965 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 13:52:24,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:24,976 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:24,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:24,985 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 13:52:24,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:24,988 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 13:52:24,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:24,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:24,994 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 13:52:24,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:24,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:25,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:25,002 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 13:52:25,003 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:25,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:25,028 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:25,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:25,049 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 13:52:25,050 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:25,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:25,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:25,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:25,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:25,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:25,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:25,075 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:25,076 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 13:52:25,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:25,103 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 13:52:25,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:25,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:25,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:25,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:25,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:25,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:25,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:25,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:25,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:25,132 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:25,133 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 13:52:25,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:25,164 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 13:52:25,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:25,183 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 13:52:25,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:25,202 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 13:52:25,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:25,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2018-12-24 13:52:25,222 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:25,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-24 13:52:25,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-24 13:52:25,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:52:25,223 INFO L87 Difference]: Start difference. First operand 98 states and 442 transitions. Second operand 7 states. [2018-12-24 13:52:25,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:25,479 INFO L93 Difference]: Finished difference Result 111 states and 462 transitions. [2018-12-24 13:52:25,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:52:25,479 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-12-24 13:52:25,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:25,481 INFO L225 Difference]: With dead ends: 111 [2018-12-24 13:52:25,481 INFO L226 Difference]: Without dead ends: 110 [2018-12-24 13:52:25,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 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 13:52:25,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-24 13:52:25,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2018-12-24 13:52:25,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-24 13:52:25,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 452 transitions. [2018-12-24 13:52:25,511 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 452 transitions. Word has length 6 [2018-12-24 13:52:25,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:25,511 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 452 transitions. [2018-12-24 13:52:25,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-24 13:52:25,511 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 452 transitions. [2018-12-24 13:52:25,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:52:25,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:25,512 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:52:25,512 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:25,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:25,512 INFO L82 PathProgramCache]: Analyzing trace with hash 893472132, now seen corresponding path program 1 times [2018-12-24 13:52:25,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:25,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:25,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:25,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:25,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:25,797 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2018-12-24 13:52:25,839 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 13:52:25,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:25,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:25,839 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:52:25,840 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [21] [2018-12-24 13:52:25,841 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:25,841 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:25,845 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:25,845 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 13:52:25,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:25,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:25,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:25,846 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 13:52:25,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:25,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:25,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:25,879 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 13:52:25,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:25,916 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 13:52:25,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:25,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:25,926 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 13:52:25,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:25,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:25,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:25,934 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 13:52:25,935 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:25,951 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:25,961 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:25,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:25,983 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 13:52:25,983 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:26,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:26,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:26,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:26,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:26,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:26,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:26,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:26,011 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 13:52:26,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:26,065 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 13:52:26,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:26,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:26,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:26,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:26,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:26,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:26,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:26,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:26,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:26,096 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:26,099 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 13:52:26,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:26,127 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 13:52:26,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:26,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:26,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:26,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:26,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:26,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:26,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:26,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:26,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:26,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:26,157 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 13:52:26,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:26,187 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 13:52:26,187 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:26,206 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 13:52:26,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:26,233 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 13:52:26,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:26,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-24 13:52:26,252 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:26,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:52:26,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:52:26,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:52:26,252 INFO L87 Difference]: Start difference. First operand 100 states and 452 transitions. Second operand 10 states. [2018-12-24 13:52:26,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:26,731 INFO L93 Difference]: Finished difference Result 153 states and 620 transitions. [2018-12-24 13:52:26,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:52:26,731 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-24 13:52:26,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:26,732 INFO L225 Difference]: With dead ends: 153 [2018-12-24 13:52:26,732 INFO L226 Difference]: Without dead ends: 152 [2018-12-24 13:52:26,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:52:26,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-24 13:52:26,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 127. [2018-12-24 13:52:26,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-24 13:52:26,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 589 transitions. [2018-12-24 13:52:26,767 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 589 transitions. Word has length 6 [2018-12-24 13:52:26,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:26,767 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 589 transitions. [2018-12-24 13:52:26,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:52:26,767 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 589 transitions. [2018-12-24 13:52:26,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:52:26,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:26,768 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:52:26,768 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:26,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:26,768 INFO L82 PathProgramCache]: Analyzing trace with hash 897235472, now seen corresponding path program 1 times [2018-12-24 13:52:26,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:26,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:26,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:26,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:26,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:26,909 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 13:52:26,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:26,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:26,909 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:52:26,910 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [23] [2018-12-24 13:52:26,910 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:26,911 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:26,913 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:26,913 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:52:26,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:26,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:26,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:26,914 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 13:52:26,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:26,923 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:26,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:26,934 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 13:52:26,938 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 13:52:26,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:26,952 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-12-24 13:52:26,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:26,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:26,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, 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 13:52:26,968 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:26,984 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:26,993 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:27,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:27,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 13:52:27,021 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2018-12-24 13:52:27,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:27,077 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:27,080 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:27,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:27,083 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 13:52:27,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:27,158 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 13:52:27,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-24 13:52:27,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:27,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:27,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:27,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:27,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:27,179 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:27,180 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 13:52:27,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:27,197 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 13:52:27,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2018-12-24 13:52:27,214 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 13:52:27,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:27,247 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 13:52:27,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:27,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:52:27,266 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:27,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:52:27,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:52:27,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:52:27,267 INFO L87 Difference]: Start difference. First operand 127 states and 589 transitions. Second operand 8 states. [2018-12-24 13:52:27,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:27,493 INFO L93 Difference]: Finished difference Result 143 states and 607 transitions. [2018-12-24 13:52:27,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:52:27,494 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2018-12-24 13:52:27,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:27,495 INFO L225 Difference]: With dead ends: 143 [2018-12-24 13:52:27,496 INFO L226 Difference]: Without dead ends: 138 [2018-12-24 13:52:27,496 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 13:52:27,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-24 13:52:27,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 127. [2018-12-24 13:52:27,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-24 13:52:27,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 588 transitions. [2018-12-24 13:52:27,528 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 588 transitions. Word has length 6 [2018-12-24 13:52:27,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:27,529 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 588 transitions. [2018-12-24 13:52:27,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:52:27,529 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 588 transitions. [2018-12-24 13:52:27,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:52:27,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:27,530 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:52:27,530 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:27,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:27,530 INFO L82 PathProgramCache]: Analyzing trace with hash 896931732, now seen corresponding path program 2 times [2018-12-24 13:52:27,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:27,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:27,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:27,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:27,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:27,825 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 13 [2018-12-24 13:52:27,887 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 13:52:27,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:27,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:27,887 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:27,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:27,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:27,888 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 13:52:27,898 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:52:27,898 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:52:27,903 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:52:27,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:52:27,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:27,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 13:52:27,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:27,911 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 13:52:27,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:27,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:27,918 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 13:52:27,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:27,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:27,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:27,927 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 13:52:27,927 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:27,944 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:27,954 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:27,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:27,977 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 13:52:27,978 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:28,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:28,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:28,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:28,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:28,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:28,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:28,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:28,006 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 13:52:28,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:28,035 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 13:52:28,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:28,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:28,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:28,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:28,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:28,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:28,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:28,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:28,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:28,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:28,074 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 13:52:28,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:28,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:52:28,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:28,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:28,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:28,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:28,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:28,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:28,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:28,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:28,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:28,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:28,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:28,148 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:28,148 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 13:52:28,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:28,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 13:52:28,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:28,204 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 13:52:28,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:28,274 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 13:52:28,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:28,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-24 13:52:28,294 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:28,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:52:28,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:52:28,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:52:28,294 INFO L87 Difference]: Start difference. First operand 127 states and 588 transitions. Second operand 10 states. [2018-12-24 13:52:28,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:28,710 INFO L93 Difference]: Finished difference Result 196 states and 812 transitions. [2018-12-24 13:52:28,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:52:28,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-24 13:52:28,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:28,713 INFO L225 Difference]: With dead ends: 196 [2018-12-24 13:52:28,713 INFO L226 Difference]: Without dead ends: 195 [2018-12-24 13:52:28,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2018-12-24 13:52:28,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-24 13:52:28,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 141. [2018-12-24 13:52:28,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-24 13:52:28,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 664 transitions. [2018-12-24 13:52:28,748 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 664 transitions. Word has length 6 [2018-12-24 13:52:28,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:28,748 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 664 transitions. [2018-12-24 13:52:28,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:52:28,749 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 664 transitions. [2018-12-24 13:52:28,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:52:28,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:28,749 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:52:28,749 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:28,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:28,750 INFO L82 PathProgramCache]: Analyzing trace with hash 897162246, now seen corresponding path program 3 times [2018-12-24 13:52:28,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:28,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:28,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:52:28,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:28,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:28,975 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2018-12-24 13:52:29,047 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 13:52:29,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:29,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:29,048 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:29,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:29,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:29,048 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 13:52:29,057 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:52:29,057 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:52:29,061 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:52:29,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:52:29,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:29,065 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 13:52:29,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,079 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 13:52:29,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,083 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 13:52:29,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,088 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 13:52:29,089 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:29,104 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:29,114 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:29,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:29,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:29,135 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:29,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,162 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 13:52:29,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:29,191 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 13:52:29,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:29,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,232 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 13:52:29,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:29,262 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 13:52:29,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:29,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,293 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:29,294 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 83 [2018-12-24 13:52:29,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:29,329 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 13:52:29,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:29,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:29,360 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:29,361 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 13:52:29,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:29,396 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 13:52:29,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:29,416 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 13:52:29,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:29,466 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 13:52:29,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:29,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2018-12-24 13:52:29,486 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:29,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:52:29,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:52:29,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:52:29,486 INFO L87 Difference]: Start difference. First operand 141 states and 664 transitions. Second operand 12 states. [2018-12-24 13:52:29,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:29,982 INFO L93 Difference]: Finished difference Result 205 states and 871 transitions. [2018-12-24 13:52:29,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:52:29,983 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2018-12-24 13:52:29,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:29,985 INFO L225 Difference]: With dead ends: 205 [2018-12-24 13:52:29,985 INFO L226 Difference]: Without dead ends: 197 [2018-12-24 13:52:29,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2018-12-24 13:52:29,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-24 13:52:30,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 149. [2018-12-24 13:52:30,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-24 13:52:30,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 702 transitions. [2018-12-24 13:52:30,028 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 702 transitions. Word has length 6 [2018-12-24 13:52:30,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:30,028 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 702 transitions. [2018-12-24 13:52:30,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:52:30,028 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 702 transitions. [2018-12-24 13:52:30,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:52:30,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:30,029 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:52:30,029 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:30,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:30,029 INFO L82 PathProgramCache]: Analyzing trace with hash 900929556, now seen corresponding path program 1 times [2018-12-24 13:52:30,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:30,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:30,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:52:30,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:30,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:30,105 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 13:52:30,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:30,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:30,105 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:52:30,105 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [23] [2018-12-24 13:52:30,106 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:30,106 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:30,109 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:30,109 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:52:30,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:30,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:30,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:30,110 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 13:52:30,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:30,123 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:30,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:30,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 13:52:30,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 13:52:30,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, 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 13:52:30,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:30,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-24 13:52:30,159 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:30,169 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:30,175 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:30,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:30,193 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 13:52:30,193 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2018-12-24 13:52:30,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:30,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:30,214 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 13:52:30,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:30,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:30,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-12-24 13:52:30,236 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:30,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:30,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:30,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:30,239 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 13:52:30,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:30,249 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 13:52:30,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2018-12-24 13:52:30,262 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 13:52:30,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:30,279 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 13:52:30,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:30,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:52:30,297 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:30,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:52:30,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:52:30,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:52:30,298 INFO L87 Difference]: Start difference. First operand 149 states and 702 transitions. Second operand 8 states. [2018-12-24 13:52:30,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:30,475 INFO L93 Difference]: Finished difference Result 165 states and 720 transitions. [2018-12-24 13:52:30,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:52:30,476 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2018-12-24 13:52:30,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:30,478 INFO L225 Difference]: With dead ends: 165 [2018-12-24 13:52:30,478 INFO L226 Difference]: Without dead ends: 164 [2018-12-24 13:52:30,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:52:30,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-24 13:52:30,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 149. [2018-12-24 13:52:30,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-24 13:52:30,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 702 transitions. [2018-12-24 13:52:30,526 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 702 transitions. Word has length 6 [2018-12-24 13:52:30,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:30,527 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 702 transitions. [2018-12-24 13:52:30,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:52:30,527 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 702 transitions. [2018-12-24 13:52:30,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:52:30,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:30,528 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:52:30,528 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:30,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:30,528 INFO L82 PathProgramCache]: Analyzing trace with hash 900750810, now seen corresponding path program 1 times [2018-12-24 13:52:30,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:30,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:30,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:30,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:30,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:30,768 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-12-24 13:52:31,055 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2018-12-24 13:52:31,097 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 13:52:31,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:31,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:31,098 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:52:31,098 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [22], [23] [2018-12-24 13:52:31,099 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:31,099 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:31,102 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:31,103 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:52:31,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:31,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:31,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:31,103 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 13:52:31,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:31,114 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:31,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:31,125 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 13:52:31,130 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 13:52:31,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:31,139 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-12-24 13:52:31,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:31,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:31,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, 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 13:52:31,155 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:31,166 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:31,174 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:31,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:31,192 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 13:52:31,192 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2018-12-24 13:52:31,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:31,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:31,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:31,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:31,221 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 13:52:31,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:31,236 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 13:52:31,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-24 13:52:31,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:31,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:31,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:31,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:31,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:31,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:31,259 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 48 [2018-12-24 13:52:31,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:31,310 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 13:52:31,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2018-12-24 13:52:31,326 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 13:52:31,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:31,344 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 13:52:31,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:31,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:52:31,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:31,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:52:31,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:52:31,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:52:31,364 INFO L87 Difference]: Start difference. First operand 149 states and 702 transitions. Second operand 8 states. [2018-12-24 13:52:31,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:31,608 INFO L93 Difference]: Finished difference Result 174 states and 765 transitions. [2018-12-24 13:52:31,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:52:31,608 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2018-12-24 13:52:31,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:31,611 INFO L225 Difference]: With dead ends: 174 [2018-12-24 13:52:31,611 INFO L226 Difference]: Without dead ends: 173 [2018-12-24 13:52:31,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:52:31,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-24 13:52:31,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 158. [2018-12-24 13:52:31,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-24 13:52:31,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 747 transitions. [2018-12-24 13:52:31,659 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 747 transitions. Word has length 6 [2018-12-24 13:52:31,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:31,660 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 747 transitions. [2018-12-24 13:52:31,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:52:31,660 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 747 transitions. [2018-12-24 13:52:31,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:52:31,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:31,661 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-12-24 13:52:31,661 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:31,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:31,661 INFO L82 PathProgramCache]: Analyzing trace with hash -2078696478, now seen corresponding path program 1 times [2018-12-24 13:52:31,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:31,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:31,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:31,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:31,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:31,821 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 13:52:31,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:31,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:31,822 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:52:31,822 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [22], [24], [25] [2018-12-24 13:52:31,823 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:31,823 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:31,826 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:31,826 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:52:31,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:31,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:31,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:31,827 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 13:52:31,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:31,836 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:31,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:31,852 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 13:52:31,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 13:52:31,865 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 13:52:31,884 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 13:52:31,884 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:31,901 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:31,913 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:31,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:31,940 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 13:52:31,941 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:15, output treesize:21 [2018-12-24 13:52:31,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:31,964 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 16 treesize of output 5 [2018-12-24 13:52:31,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:31,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:31,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2018-12-24 13:52:32,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:32,132 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 13:52:32,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:32,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:32,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2018-12-24 13:52:32,139 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 13:52:32,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:32,153 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 13:52:32,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-24 13:52:32,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 8 [2018-12-24 13:52:32,171 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:52:32,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-24 13:52:32,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-24 13:52:32,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:52:32,172 INFO L87 Difference]: Start difference. First operand 158 states and 747 transitions. Second operand 5 states. [2018-12-24 13:52:32,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:32,328 INFO L93 Difference]: Finished difference Result 357 states and 1628 transitions. [2018-12-24 13:52:32,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 13:52:32,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-12-24 13:52:32,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:32,331 INFO L225 Difference]: With dead ends: 357 [2018-12-24 13:52:32,332 INFO L226 Difference]: Without dead ends: 353 [2018-12-24 13:52:32,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:52:32,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-12-24 13:52:32,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 329. [2018-12-24 13:52:32,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-12-24 13:52:32,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1593 transitions. [2018-12-24 13:52:32,468 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 1593 transitions. Word has length 7 [2018-12-24 13:52:32,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:32,468 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 1593 transitions. [2018-12-24 13:52:32,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-24 13:52:32,469 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 1593 transitions. [2018-12-24 13:52:32,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:52:32,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:32,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:52:32,471 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:32,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:32,471 INFO L82 PathProgramCache]: Analyzing trace with hash -2087931688, now seen corresponding path program 1 times [2018-12-24 13:52:32,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:32,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:32,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:32,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:32,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:32,737 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-12-24 13:52:32,767 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 13:52:32,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:32,768 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:32,768 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:52:32,768 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [24], [25] [2018-12-24 13:52:32,769 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:32,770 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:32,772 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:32,772 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:52:32,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:32,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:32,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:32,773 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 13:52:32,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:32,786 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:32,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:32,794 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 13:52:32,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:32,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 13:52:32,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:32,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:32,857 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 13:52:32,860 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:32,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:32,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:32,865 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 13:52:32,865 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:32,884 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:32,894 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:32,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:32,919 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 13:52:32,919 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:32,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:32,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:32,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:32,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:32,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:32,943 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:32,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:32,945 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 13:52:32,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:32,974 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 13:52:32,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:32,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:32,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:32,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:32,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:32,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:32,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:33,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:33,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:33,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:33,004 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 13:52:33,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:33,039 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 13:52:33,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:33,064 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 13:52:33,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:33,233 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 13:52:33,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:33,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:52:33,253 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:33,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:52:33,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:52:33,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:52:33,253 INFO L87 Difference]: Start difference. First operand 329 states and 1593 transitions. Second operand 8 states. [2018-12-24 13:52:33,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:33,570 INFO L93 Difference]: Finished difference Result 348 states and 1627 transitions. [2018-12-24 13:52:33,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:52:33,575 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-12-24 13:52:33,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:33,578 INFO L225 Difference]: With dead ends: 348 [2018-12-24 13:52:33,578 INFO L226 Difference]: Without dead ends: 338 [2018-12-24 13:52:33,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:52:33,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-12-24 13:52:33,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 333. [2018-12-24 13:52:33,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-12-24 13:52:33,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 1604 transitions. [2018-12-24 13:52:33,683 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 1604 transitions. Word has length 7 [2018-12-24 13:52:33,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:33,684 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 1604 transitions. [2018-12-24 13:52:33,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:52:33,684 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 1604 transitions. [2018-12-24 13:52:33,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:52:33,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:33,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:52:33,685 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:33,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:33,685 INFO L82 PathProgramCache]: Analyzing trace with hash -2088231584, now seen corresponding path program 1 times [2018-12-24 13:52:33,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:33,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:33,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:33,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:33,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:33,830 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 13:52:33,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:33,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:33,831 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:52:33,831 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [23] [2018-12-24 13:52:33,832 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:33,832 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:33,835 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:33,835 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 13:52:33,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:33,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:33,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:33,836 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 13:52:33,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:33,844 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:33,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:33,858 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 13:52:33,860 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:33,860 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 13:52:33,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:33,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:33,866 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 13:52:33,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:33,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:33,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:33,873 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 13:52:33,874 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:33,893 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:33,905 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:33,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:33,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:33,927 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:33,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:33,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:33,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:33,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:33,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:33,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:33,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:33,954 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 13:52:33,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:33,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:52:33,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:34,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:34,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:34,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:34,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:34,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:34,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:34,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:34,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:34,017 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:34,017 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 13:52:34,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:34,054 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 13:52:34,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:34,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:34,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:34,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:34,080 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:34,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:34,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:34,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:34,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:34,085 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:34,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:34,087 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 13:52:34,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:34,123 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 13:52:34,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2018-12-24 13:52:34,145 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 13:52:34,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:34,187 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 13:52:34,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:34,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:52:34,213 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:34,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:52:34,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:52:34,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:52:34,213 INFO L87 Difference]: Start difference. First operand 333 states and 1604 transitions. Second operand 10 states. [2018-12-24 13:52:34,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:34,633 INFO L93 Difference]: Finished difference Result 348 states and 1634 transitions. [2018-12-24 13:52:34,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:52:34,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2018-12-24 13:52:34,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:34,636 INFO L225 Difference]: With dead ends: 348 [2018-12-24 13:52:34,636 INFO L226 Difference]: Without dead ends: 343 [2018-12-24 13:52:34,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:52:34,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-12-24 13:52:34,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 334. [2018-12-24 13:52:34,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-12-24 13:52:34,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1603 transitions. [2018-12-24 13:52:34,740 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1603 transitions. Word has length 7 [2018-12-24 13:52:34,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:34,740 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 1603 transitions. [2018-12-24 13:52:34,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:52:34,740 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1603 transitions. [2018-12-24 13:52:34,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:52:34,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:34,742 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:52:34,742 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:34,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:34,742 INFO L82 PathProgramCache]: Analyzing trace with hash -2088122094, now seen corresponding path program 1 times [2018-12-24 13:52:34,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:34,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:34,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:34,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:34,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:34,959 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 13:52:34,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:34,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:34,960 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:52:34,960 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [21] [2018-12-24 13:52:34,961 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:34,961 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:34,964 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:34,964 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-24 13:52:34,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:34,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:34,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:34,965 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 13:52:34,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:34,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:34,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:34,985 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 13:52:34,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:34,990 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 13:52:35,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,046 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 13:52:35,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,062 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 13:52:35,063 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:35,082 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:35,090 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:35,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:35,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:35,112 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:35,132 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,139 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 13:52:35,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:35,165 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 13:52:35,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:35,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,197 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 13:52:35,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:35,246 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 13:52:35,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:35,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,279 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:35,280 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 13:52:35,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:35,316 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 13:52:35,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:35,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,345 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,350 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:35,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:35,352 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 13:52:35,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:35,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 13:52:35,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2018-12-24 13:52:35,406 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 13:52:35,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:35,455 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 13:52:35,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:35,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2018-12-24 13:52:35,475 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:35,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:52:35,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:52:35,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:52:35,476 INFO L87 Difference]: Start difference. First operand 334 states and 1603 transitions. Second operand 12 states. [2018-12-24 13:52:36,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:36,103 INFO L93 Difference]: Finished difference Result 457 states and 2102 transitions. [2018-12-24 13:52:36,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:52:36,104 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2018-12-24 13:52:36,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:36,108 INFO L225 Difference]: With dead ends: 457 [2018-12-24 13:52:36,108 INFO L226 Difference]: Without dead ends: 456 [2018-12-24 13:52:36,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2018-12-24 13:52:36,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-12-24 13:52:36,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 329. [2018-12-24 13:52:36,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-12-24 13:52:36,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1582 transitions. [2018-12-24 13:52:36,243 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 1582 transitions. Word has length 7 [2018-12-24 13:52:36,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:36,243 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 1582 transitions. [2018-12-24 13:52:36,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:52:36,244 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 1582 transitions. [2018-12-24 13:52:36,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:52:36,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:36,245 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:52:36,245 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:36,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:36,245 INFO L82 PathProgramCache]: Analyzing trace with hash -2084662494, now seen corresponding path program 2 times [2018-12-24 13:52:36,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:36,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:36,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:36,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:36,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:36,491 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 20 [2018-12-24 13:52:36,564 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 13:52:36,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:36,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:36,565 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:36,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:36,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:36,565 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 13:52:36,574 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:52:36,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:52:36,585 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:52:36,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:52:36,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:36,591 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 13:52:36,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,594 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 13:52:36,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,598 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 13:52:36,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,604 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 13:52:36,605 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:36,622 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:36,632 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:36,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:36,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:36,653 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:36,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,681 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 13:52:36,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:36,707 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 13:52:36,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:36,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,736 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:36,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2018-12-24 13:52:36,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:36,764 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 13:52:36,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2018-12-24 13:52:36,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,795 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 13:52:36,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:36,827 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 13:52:36,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2018-12-24 13:52:36,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:36,860 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:36,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 35 treesize of output 75 [2018-12-24 13:52:36,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:36,894 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 13:52:36,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2018-12-24 13:52:36,917 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 13:52:36,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:36,984 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 13:52:37,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:37,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2018-12-24 13:52:37,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:37,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 13:52:37,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 13:52:37,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:52:37,004 INFO L87 Difference]: Start difference. First operand 329 states and 1582 transitions. Second operand 11 states. [2018-12-24 13:52:37,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:37,631 INFO L93 Difference]: Finished difference Result 346 states and 1608 transitions. [2018-12-24 13:52:37,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:52:37,631 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2018-12-24 13:52:37,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:37,635 INFO L225 Difference]: With dead ends: 346 [2018-12-24 13:52:37,636 INFO L226 Difference]: Without dead ends: 345 [2018-12-24 13:52:37,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-12-24 13:52:37,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-12-24 13:52:37,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 213. [2018-12-24 13:52:37,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-24 13:52:37,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 1003 transitions. [2018-12-24 13:52:37,728 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 1003 transitions. Word has length 7 [2018-12-24 13:52:37,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:37,728 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 1003 transitions. [2018-12-24 13:52:37,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 13:52:37,728 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 1003 transitions. [2018-12-24 13:52:37,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:52:37,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:37,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:52:37,729 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:37,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:37,729 INFO L82 PathProgramCache]: Analyzing trace with hash -2084418336, now seen corresponding path program 1 times [2018-12-24 13:52:37,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:37,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:37,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:52:37,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:37,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:37,861 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 13:52:37,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:37,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:37,862 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:52:37,863 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [22], [23] [2018-12-24 13:52:37,864 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:37,864 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:37,866 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:37,866 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 13:52:37,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:37,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:37,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:37,867 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 13:52:37,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:37,879 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:37,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:37,887 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 13:52:37,893 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 13:52:37,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:37,903 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-12-24 13:52:37,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:37,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:37,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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 13:52:37,915 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:37,927 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:37,934 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:37,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:37,953 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 13:52:37,953 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2018-12-24 13:52:37,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:37,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:37,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:37,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:37,982 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 13:52:37,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:37,996 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 13:52:37,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-24 13:52:38,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:38,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:38,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:38,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:38,016 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:38,016 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 13:52:38,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:38,035 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 13:52:38,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:22 [2018-12-24 13:52:38,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:38,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:38,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:38,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:38,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:38,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:38,060 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 44 [2018-12-24 13:52:38,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:38,079 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 13:52:38,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2018-12-24 13:52:38,098 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 13:52:38,099 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:38,132 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 13:52:38,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:38,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-24 13:52:38,151 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:38,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:52:38,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:52:38,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:52:38,152 INFO L87 Difference]: Start difference. First operand 213 states and 1003 transitions. Second operand 10 states. [2018-12-24 13:52:38,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:38,522 INFO L93 Difference]: Finished difference Result 280 states and 1278 transitions. [2018-12-24 13:52:38,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:52:38,523 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2018-12-24 13:52:38,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:38,525 INFO L225 Difference]: With dead ends: 280 [2018-12-24 13:52:38,525 INFO L226 Difference]: Without dead ends: 277 [2018-12-24 13:52:38,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:52:38,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-12-24 13:52:38,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 242. [2018-12-24 13:52:38,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-12-24 13:52:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 1141 transitions. [2018-12-24 13:52:38,625 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 1141 transitions. Word has length 7 [2018-12-24 13:52:38,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:38,625 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 1141 transitions. [2018-12-24 13:52:38,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:52:38,625 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 1141 transitions. [2018-12-24 13:52:38,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:52:38,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:38,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:52:38,626 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:38,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:38,627 INFO L82 PathProgramCache]: Analyzing trace with hash -2080543520, now seen corresponding path program 1 times [2018-12-24 13:52:38,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:38,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:38,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:38,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:38,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:38,730 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 13:52:38,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:38,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:38,730 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:52:38,730 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [24], [25] [2018-12-24 13:52:38,732 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:38,732 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:38,734 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:38,734 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:52:38,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:38,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:38,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:38,735 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 13:52:38,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:38,748 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:38,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:38,754 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 13:52:38,760 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 13:52:38,769 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 13:52:38,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:38,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-24 13:52:38,782 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:38,791 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:38,798 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:38,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:38,815 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 13:52:38,816 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2018-12-24 13:52:38,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:38,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:38,836 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 15 [2018-12-24 13:52:38,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:38,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:38,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-12-24 13:52:38,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:38,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:38,860 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:38,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:38,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2018-12-24 13:52:38,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:38,871 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 13:52:38,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2018-12-24 13:52:38,884 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 13:52:38,884 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:38,897 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 13:52:38,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:38,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2018-12-24 13:52:38,917 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:38,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-24 13:52:38,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-24 13:52:38,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:52:38,918 INFO L87 Difference]: Start difference. First operand 242 states and 1141 transitions. Second operand 9 states. [2018-12-24 13:52:39,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:39,261 INFO L93 Difference]: Finished difference Result 390 states and 1798 transitions. [2018-12-24 13:52:39,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:52:39,261 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2018-12-24 13:52:39,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:39,265 INFO L225 Difference]: With dead ends: 390 [2018-12-24 13:52:39,265 INFO L226 Difference]: Without dead ends: 377 [2018-12-24 13:52:39,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:52:39,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-12-24 13:52:39,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 367. [2018-12-24 13:52:39,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-12-24 13:52:39,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1654 transitions. [2018-12-24 13:52:39,421 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1654 transitions. Word has length 7 [2018-12-24 13:52:39,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:39,421 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1654 transitions. [2018-12-24 13:52:39,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-24 13:52:39,421 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1654 transitions. [2018-12-24 13:52:39,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:52:39,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:39,423 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-12-24 13:52:39,423 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:39,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:39,423 INFO L82 PathProgramCache]: Analyzing trace with hash -2080966800, now seen corresponding path program 4 times [2018-12-24 13:52:39,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:39,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:39,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:39,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:39,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:39,615 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:52:39,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:39,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:39,616 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:39,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:39,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:39,616 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 13:52:39,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:39,625 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:39,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:39,636 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 13:52:39,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,642 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 13:52:39,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,648 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 13:52:39,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,658 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 13:52:39,659 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:39,675 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:39,684 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:39,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:39,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:39,705 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:39,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,730 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,735 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 13:52:39,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:39,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:39,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:39,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,785 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,794 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 13:52:39,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:39,824 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 13:52:39,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:39,847 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,847 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,857 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:39,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2018-12-24 13:52:39,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:39,890 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 13:52:39,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:39,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,924 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 13:52:39,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:39,960 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 13:52:39,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2018-12-24 13:52:39,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,989 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:39,998 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 13:52:39,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:40,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:52:40,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:40,052 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 13:52:40,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:40,132 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:40,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:40,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2018-12-24 13:52:40,152 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:40,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-24 13:52:40,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-24 13:52:40,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=220, Unknown=0, NotChecked=0, Total=342 [2018-12-24 13:52:40,153 INFO L87 Difference]: Start difference. First operand 367 states and 1654 transitions. Second operand 13 states. [2018-12-24 13:52:40,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:40,772 INFO L93 Difference]: Finished difference Result 375 states and 1668 transitions. [2018-12-24 13:52:40,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:52:40,773 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2018-12-24 13:52:40,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:40,777 INFO L225 Difference]: With dead ends: 375 [2018-12-24 13:52:40,777 INFO L226 Difference]: Without dead ends: 374 [2018-12-24 13:52:40,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2018-12-24 13:52:40,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-12-24 13:52:40,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 147. [2018-12-24 13:52:40,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-24 13:52:40,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 607 transitions. [2018-12-24 13:52:40,900 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 607 transitions. Word has length 7 [2018-12-24 13:52:40,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:40,900 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 607 transitions. [2018-12-24 13:52:40,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-24 13:52:40,900 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 607 transitions. [2018-12-24 13:52:40,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:52:40,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:40,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:52:40,902 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:40,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:40,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1924438182, now seen corresponding path program 1 times [2018-12-24 13:52:40,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:40,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:40,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:40,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:40,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:41,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 13:52:41,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:41,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:41,066 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:52:41,067 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [24], [25] [2018-12-24 13:52:41,067 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:41,067 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:41,070 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:41,070 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:52:41,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:41,070 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:41,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:41,070 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 13:52:41,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:41,080 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:41,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:41,090 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 13:52:41,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:41,117 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 13:52:41,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:41,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:41,180 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 13:52:41,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:41,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:41,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:41,189 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 13:52:41,189 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:41,207 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:41,217 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:41,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:41,239 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 13:52:41,240 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:41,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:41,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:41,260 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:41,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:41,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:41,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:41,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:41,265 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 13:52:41,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:41,294 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 13:52:41,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:41,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:41,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:41,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:41,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:41,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:41,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:41,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:41,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:41,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:41,322 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 13:52:41,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:41,354 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 13:52:41,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:41,371 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 13:52:41,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:41,389 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 13:52:41,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:41,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2018-12-24 13:52:41,408 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:41,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-24 13:52:41,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-24 13:52:41,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:52:41,409 INFO L87 Difference]: Start difference. First operand 147 states and 607 transitions. Second operand 7 states. [2018-12-24 13:52:41,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:41,710 INFO L93 Difference]: Finished difference Result 157 states and 628 transitions. [2018-12-24 13:52:41,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:52:41,710 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-24 13:52:41,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:41,712 INFO L225 Difference]: With dead ends: 157 [2018-12-24 13:52:41,712 INFO L226 Difference]: Without dead ends: 150 [2018-12-24 13:52:41,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:52:41,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-24 13:52:41,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-12-24 13:52:41,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-24 13:52:41,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 611 transitions. [2018-12-24 13:52:41,834 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 611 transitions. Word has length 7 [2018-12-24 13:52:41,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:41,834 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 611 transitions. [2018-12-24 13:52:41,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-24 13:52:41,834 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 611 transitions. [2018-12-24 13:52:41,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:52:41,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:41,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:52:41,835 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:41,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:41,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1928011116, now seen corresponding path program 1 times [2018-12-24 13:52:41,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:41,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:41,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:41,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:41,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:41,998 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 13:52:41,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:41,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:41,999 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:52:41,999 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [23] [2018-12-24 13:52:42,000 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:42,000 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:42,003 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:42,003 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 13:52:42,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:42,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:42,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:42,004 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 13:52:42,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:42,012 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:42,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:42,030 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 13:52:42,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,033 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 13:52:42,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,041 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 13:52:42,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,046 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 13:52:42,047 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:42,064 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:42,074 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:42,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:42,100 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 13:52:42,101 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:42,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,132 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,146 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 13:52:42,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:42,182 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 13:52:42,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:42,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,230 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:42,230 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 13:52:42,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:42,275 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 13:52:42,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:42,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:42,320 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 13:52:42,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:42,355 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 13:52:42,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:42,384 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 13:52:42,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:42,488 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 13:52:42,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:42,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:52:42,508 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:42,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:52:42,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:52:42,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:52:42,508 INFO L87 Difference]: Start difference. First operand 149 states and 611 transitions. Second operand 10 states. [2018-12-24 13:52:43,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:43,061 INFO L93 Difference]: Finished difference Result 206 states and 810 transitions. [2018-12-24 13:52:43,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:52:43,061 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2018-12-24 13:52:43,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:43,064 INFO L225 Difference]: With dead ends: 206 [2018-12-24 13:52:43,064 INFO L226 Difference]: Without dead ends: 199 [2018-12-24 13:52:43,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:52:43,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-12-24 13:52:43,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 158. [2018-12-24 13:52:43,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-24 13:52:43,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 646 transitions. [2018-12-24 13:52:43,289 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 646 transitions. Word has length 7 [2018-12-24 13:52:43,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:43,289 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 646 transitions. [2018-12-24 13:52:43,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:52:43,289 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 646 transitions. [2018-12-24 13:52:43,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:52:43,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:43,290 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:52:43,290 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:43,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:43,290 INFO L82 PathProgramCache]: Analyzing trace with hash 2042527720, now seen corresponding path program 2 times [2018-12-24 13:52:43,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:43,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:43,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:43,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:43,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:43,461 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 13:52:43,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:43,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:43,461 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:43,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:43,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:43,461 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 13:52:43,470 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:52:43,470 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:52:43,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:52:43,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:52:43,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:43,499 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 13:52:43,505 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 13:52:43,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:43,509 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-12-24 13:52:43,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:43,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:43,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2018-12-24 13:52:43,518 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:43,528 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:43,536 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:43,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:43,554 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 13:52:43,554 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2018-12-24 13:52:43,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:43,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:43,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:43,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:43,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 34 [2018-12-24 13:52:43,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:43,599 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 13:52:43,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-24 13:52:43,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:43,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:43,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:43,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:43,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:43,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:43,619 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 13:52:43,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:43,639 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 13:52:43,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2018-12-24 13:52:43,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:43,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:43,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:43,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:43,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:43,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:43,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:43,669 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:43,670 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 13:52:43,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:43,689 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 13:52:43,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2018-12-24 13:52:43,706 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 13:52:43,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:43,740 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 13:52:43,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:43,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-24 13:52:43,760 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:43,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:52:43,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:52:43,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:52:43,761 INFO L87 Difference]: Start difference. First operand 158 states and 646 transitions. Second operand 10 states. [2018-12-24 13:52:44,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:44,207 INFO L93 Difference]: Finished difference Result 161 states and 653 transitions. [2018-12-24 13:52:44,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:52:44,208 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2018-12-24 13:52:44,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:44,210 INFO L225 Difference]: With dead ends: 161 [2018-12-24 13:52:44,210 INFO L226 Difference]: Without dead ends: 156 [2018-12-24 13:52:44,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:52:44,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-12-24 13:52:44,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 33. [2018-12-24 13:52:44,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-24 13:52:44,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 119 transitions. [2018-12-24 13:52:44,283 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 119 transitions. Word has length 7 [2018-12-24 13:52:44,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:44,283 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 119 transitions. [2018-12-24 13:52:44,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:52:44,284 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 119 transitions. [2018-12-24 13:52:44,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:52:44,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:44,284 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:52:44,284 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:44,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:44,284 INFO L82 PathProgramCache]: Analyzing trace with hash -305786232, now seen corresponding path program 1 times [2018-12-24 13:52:44,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:44,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:44,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:52:44,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:44,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:44,436 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 13:52:44,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:44,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:44,437 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-24 13:52:44,437 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [24], [25] [2018-12-24 13:52:44,440 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:44,440 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:44,442 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:44,442 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 3. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 13:52:44,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:44,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:44,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:44,443 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 13:52:44,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:44,455 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:44,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:44,463 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 13:52:44,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:52:44,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,476 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 13:52:44,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,481 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 13:52:44,482 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:44,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:44,507 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:44,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:44,528 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 13:52:44,529 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:44,548 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,551 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,555 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 13:52:44,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:44,583 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 13:52:44,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:44,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,611 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 13:52:44,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:44,639 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 13:52:44,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:44,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:44,668 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:44,669 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 13:52:44,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:44,702 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 13:52:44,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:44,723 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 13:52:44,723 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:44,754 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 13:52:44,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:44,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:52:44,773 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:44,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:52:44,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:52:44,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:52:44,774 INFO L87 Difference]: Start difference. First operand 33 states and 119 transitions. Second operand 10 states. [2018-12-24 13:52:45,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:45,154 INFO L93 Difference]: Finished difference Result 62 states and 209 transitions. [2018-12-24 13:52:45,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:52:45,154 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2018-12-24 13:52:45,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:45,156 INFO L225 Difference]: With dead ends: 62 [2018-12-24 13:52:45,156 INFO L226 Difference]: Without dead ends: 52 [2018-12-24 13:52:45,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:52:45,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-24 13:52:45,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2018-12-24 13:52:45,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-24 13:52:45,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 167 transitions. [2018-12-24 13:52:45,299 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 167 transitions. Word has length 8 [2018-12-24 13:52:45,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:45,300 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 167 transitions. [2018-12-24 13:52:45,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:52:45,300 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 167 transitions. [2018-12-24 13:52:45,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:52:45,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:45,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:52:45,301 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:45,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:45,301 INFO L82 PathProgramCache]: Analyzing trace with hash -477561138, now seen corresponding path program 1 times [2018-12-24 13:52:45,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:45,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:45,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:45,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:45,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:45,440 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 13:52:45,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:45,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:45,441 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-24 13:52:45,441 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [22], [24], [25] [2018-12-24 13:52:45,441 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:45,441 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:45,444 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:45,444 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 3. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 13:52:45,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:45,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:45,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:45,445 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 13:52:45,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:45,462 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:45,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:45,473 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 13:52:45,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,475 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 13:52:45,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,481 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 13:52:45,486 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,488 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 13:52:45,488 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:45,504 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:45,514 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:45,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:45,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:45,536 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:45,557 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,557 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,558 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,559 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,564 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 13:52:45,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:45,593 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 13:52:45,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:45,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,625 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 13:52:45,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:45,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:52:45,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:45,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:45,691 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:45,692 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 13:52:45,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:45,723 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 13:52:45,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:45,744 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 13:52:45,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:45,776 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 13:52:45,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:45,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2018-12-24 13:52:45,795 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:45,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:52:45,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:52:45,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:52:45,796 INFO L87 Difference]: Start difference. First operand 45 states and 167 transitions. Second operand 8 states. [2018-12-24 13:52:46,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:46,199 INFO L93 Difference]: Finished difference Result 59 states and 204 transitions. [2018-12-24 13:52:46,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:52:46,200 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-24 13:52:46,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:46,200 INFO L225 Difference]: With dead ends: 59 [2018-12-24 13:52:46,200 INFO L226 Difference]: Without dead ends: 52 [2018-12-24 13:52:46,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-12-24 13:52:46,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-24 13:52:46,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2018-12-24 13:52:46,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-24 13:52:46,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 167 transitions. [2018-12-24 13:52:46,331 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 167 transitions. Word has length 8 [2018-12-24 13:52:46,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:46,331 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 167 transitions. [2018-12-24 13:52:46,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:52:46,331 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 167 transitions. [2018-12-24 13:52:46,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 13:52:46,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:46,332 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:52:46,332 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:46,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:46,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1160942496, now seen corresponding path program 2 times [2018-12-24 13:52:46,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:46,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:46,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:46,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:46,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:46,478 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 13:52:46,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:46,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:46,479 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:46,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:46,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:46,479 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 13:52:46,489 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:52:46,489 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:52:46,496 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:52:46,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:52:46,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:46,500 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 13:52:46,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,505 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 13:52:46,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,518 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 13:52:46,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,525 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 13:52:46,525 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:46,542 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:46,549 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:46,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:46,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:52:46,571 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:46,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,598 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 13:52:46,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:46,625 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 13:52:46,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:46,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,653 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 13:52:46,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:46,683 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 13:52:46,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:46,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,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, 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 13:52:46,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:46,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:52:46,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:46,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,783 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,785 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:46,790 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 13:52:46,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:46,829 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 13:52:46,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:46,852 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 13:52:46,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:46,928 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 13:52:46,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:46,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2018-12-24 13:52:46,947 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:46,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:52:46,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:52:46,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2018-12-24 13:52:46,948 INFO L87 Difference]: Start difference. First operand 45 states and 167 transitions. Second operand 10 states. [2018-12-24 13:52:47,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:47,490 INFO L93 Difference]: Finished difference Result 67 states and 237 transitions. [2018-12-24 13:52:47,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:52:47,491 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-12-24 13:52:47,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:47,491 INFO L225 Difference]: With dead ends: 67 [2018-12-24 13:52:47,491 INFO L226 Difference]: Without dead ends: 32 [2018-12-24 13:52:47,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:52:47,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-24 13:52:47,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-12-24 13:52:47,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-24 13:52:47,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 100 transitions. [2018-12-24 13:52:47,601 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 100 transitions. Word has length 9 [2018-12-24 13:52:47,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:47,601 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 100 transitions. [2018-12-24 13:52:47,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:52:47,601 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 100 transitions. [2018-12-24 13:52:47,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 13:52:47,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:47,602 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:52:47,602 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:47,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:47,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1292813016, now seen corresponding path program 1 times [2018-12-24 13:52:47,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:47,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:47,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:52:47,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:47,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:47,719 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 13:52:47,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:47,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:47,720 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-24 13:52:47,720 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [24], [25] [2018-12-24 13:52:47,721 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:47,721 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:47,723 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:47,724 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 3. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 13:52:47,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:47,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:47,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:47,724 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 13:52:47,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:47,735 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:47,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:47,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, 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 13:52:47,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,754 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 13:52:47,758 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,760 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,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 13:52:47,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,775 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 13:52:47,775 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:47,792 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:47,802 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:47,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:47,824 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 13:52:47,825 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:47,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,847 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,851 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 13:52:47,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:47,881 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 13:52:47,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:47,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,916 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 13:52:47,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:47,946 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 13:52:47,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:47,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,973 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:47,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 31 treesize of output 65 [2018-12-24 13:52:47,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:48,020 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 13:52:48,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:48,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:48,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:48,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:48,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:48,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:48,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:48,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:48,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:48,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:48,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:48,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:48,054 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:48,055 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 13:52:48,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:48,090 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 13:52:48,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:48,108 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 13:52:48,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:48,146 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 13:52:48,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:48,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2018-12-24 13:52:48,166 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:48,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:52:48,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:52:48,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2018-12-24 13:52:48,166 INFO L87 Difference]: Start difference. First operand 30 states and 100 transitions. Second operand 10 states. [2018-12-24 13:52:48,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:48,561 INFO L93 Difference]: Finished difference Result 47 states and 147 transitions. [2018-12-24 13:52:48,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:52:48,561 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-12-24 13:52:48,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:48,562 INFO L225 Difference]: With dead ends: 47 [2018-12-24 13:52:48,562 INFO L226 Difference]: Without dead ends: 40 [2018-12-24 13:52:48,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:52:48,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-24 13:52:48,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-12-24 13:52:48,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-24 13:52:48,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 122 transitions. [2018-12-24 13:52:48,692 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 122 transitions. Word has length 9 [2018-12-24 13:52:48,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:48,693 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 122 transitions. [2018-12-24 13:52:48,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:52:48,693 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 122 transitions. [2018-12-24 13:52:48,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 13:52:48,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:48,693 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:52:48,693 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:48,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:48,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1875225892, now seen corresponding path program 2 times [2018-12-24 13:52:48,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:48,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:48,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:48,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:48,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:48,832 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-24 13:52:48,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:48,833 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:48,833 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:48,833 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:48,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:48,833 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:52:48,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:52:48,843 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:52:48,849 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:52:48,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:52:48,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:48,852 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 13:52:48,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:48,856 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 13:52:48,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:48,860 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:48,860 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 13:52:48,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:48,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:48,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:48,867 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 13:52:48,868 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:48,884 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:48,893 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:48,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:48,914 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 13:52:48,915 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:48,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:48,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:48,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:48,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:48,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:48,939 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:48,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:48,941 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 13:52:48,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:48,969 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 13:52:48,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:48,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:48,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:48,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:48,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:48,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:48,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:49,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:49,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:49,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:49,003 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 13:52:49,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:49,033 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 13:52:49,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:49,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:49,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:49,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:49,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:49,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:49,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:49,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:49,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:49,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:49,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:49,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:49,072 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:49,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 13:52:49,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:49,109 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 13:52:49,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:49,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:49,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:49,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:49,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:49,132 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:49,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:49,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:49,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:49,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:49,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:49,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:49,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:49,140 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 35 treesize of output 81 [2018-12-24 13:52:49,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:49,177 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 13:52:49,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2018-12-24 13:52:49,196 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 13:52:49,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:49,245 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 13:52:49,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:49,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2018-12-24 13:52:49,264 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:49,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 13:52:49,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 13:52:49,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:52:49,265 INFO L87 Difference]: Start difference. First operand 36 states and 122 transitions. Second operand 11 states. [2018-12-24 13:52:49,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:49,725 INFO L93 Difference]: Finished difference Result 52 states and 168 transitions. [2018-12-24 13:52:49,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:52:49,725 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2018-12-24 13:52:49,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:49,726 INFO L225 Difference]: With dead ends: 52 [2018-12-24 13:52:49,726 INFO L226 Difference]: Without dead ends: 45 [2018-12-24 13:52:49,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-12-24 13:52:49,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-24 13:52:49,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2018-12-24 13:52:49,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-24 13:52:49,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 138 transitions. [2018-12-24 13:52:49,868 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 138 transitions. Word has length 9 [2018-12-24 13:52:49,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:49,868 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 138 transitions. [2018-12-24 13:52:49,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 13:52:49,868 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 138 transitions. [2018-12-24 13:52:49,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 13:52:49,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:49,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:52:49,869 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:49,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:49,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1867837724, now seen corresponding path program 1 times [2018-12-24 13:52:49,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:49,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:49,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:52:49,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:49,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:50,050 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 13:52:50,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:50,051 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:50,051 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-24 13:52:50,051 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [22], [24], [25] [2018-12-24 13:52:50,052 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:52:50,052 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:52:50,054 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:52:50,054 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-24 13:52:50,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:50,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:52:50,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:50,055 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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:52:50,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:50,064 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:50,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:50,073 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 13:52:50,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,078 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 13:52:50,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,084 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 13:52:50,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,091 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 13:52:50,092 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:50,119 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:50,127 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:50,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:50,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:50,146 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:50,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,176 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 13:52:50,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:50,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:52:50,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:50,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,438 INFO L303 Elim1Store]: Index analysis took 217 ms [2018-12-24 13:52:50,439 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 13:52:50,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:50,487 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 13:52:50,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:50,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,520 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:50,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2018-12-24 13:52:50,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:50,554 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 13:52:50,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:50,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:50,586 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:50,587 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 13:52:50,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:50,621 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 13:52:50,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2018-12-24 13:52:50,641 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 13:52:50,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:50,753 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 13:52:50,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:50,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2018-12-24 13:52:50,772 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:50,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:52:50,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:52:50,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:52:50,773 INFO L87 Difference]: Start difference. First operand 40 states and 138 transitions. Second operand 12 states. [2018-12-24 13:52:51,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:51,331 INFO L93 Difference]: Finished difference Result 66 states and 218 transitions. [2018-12-24 13:52:51,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:52:51,331 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2018-12-24 13:52:51,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:51,332 INFO L225 Difference]: With dead ends: 66 [2018-12-24 13:52:51,332 INFO L226 Difference]: Without dead ends: 56 [2018-12-24 13:52:51,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2018-12-24 13:52:51,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-24 13:52:51,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2018-12-24 13:52:51,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-24 13:52:51,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 140 transitions. [2018-12-24 13:52:51,493 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 140 transitions. Word has length 9 [2018-12-24 13:52:51,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:51,493 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 140 transitions. [2018-12-24 13:52:51,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:52:51,493 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 140 transitions. [2018-12-24 13:52:51,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-24 13:52:51,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:51,493 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:52:51,494 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:51,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:51,494 INFO L82 PathProgramCache]: Analyzing trace with hash 638911500, now seen corresponding path program 2 times [2018-12-24 13:52:51,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:51,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:51,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:51,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:51,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:51,748 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-24 13:52:51,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:51,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:51,749 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:51,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:51,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:51,750 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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:52:51,760 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:52:51,760 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:52:51,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-24 13:52:51,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:52:51,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:51,771 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 13:52:51,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:51,773 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 13:52:51,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:51,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:51,777 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 13:52:51,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:51,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:51,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:51,782 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 13:52:51,782 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:51,800 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:51,809 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:51,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:51,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:51,831 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2018-12-24 13:52:51,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:51,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:51,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:51,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:51,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:51,860 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:51,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:51,862 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 13:52:51,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:51,889 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 13:52:51,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:52:51,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:51,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:51,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:51,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:51,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:51,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:51,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:51,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:51,964 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:52:51,965 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 58 [2018-12-24 13:52:51,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:52,011 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 13:52:52,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2018-12-24 13:52:52,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,040 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 13:52:52,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:52,068 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 13:52:52,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:34 [2018-12-24 13:52:52,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,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, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2018-12-24 13:52:52,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:52,141 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 13:52:52,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2018-12-24 13:52:52,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:52:52,177 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 35 treesize of output 81 [2018-12-24 13:52:52,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:52,211 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 13:52:52,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2018-12-24 13:52:52,236 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 13:52:52,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:52,304 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 13:52:52,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:52,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 16 [2018-12-24 13:52:52,324 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:52,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:52:52,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:52:52,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-12-24 13:52:52,324 INFO L87 Difference]: Start difference. First operand 40 states and 140 transitions. Second operand 12 states. [2018-12-24 13:52:53,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:53,010 INFO L93 Difference]: Finished difference Result 48 states and 164 transitions. [2018-12-24 13:52:53,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:52:53,011 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2018-12-24 13:52:53,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:53,011 INFO L225 Difference]: With dead ends: 48 [2018-12-24 13:52:53,011 INFO L226 Difference]: Without dead ends: 0 [2018-12-24 13:52:53,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2018-12-24 13:52:53,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-24 13:52:53,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-24 13:52:53,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-24 13:52:53,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-24 13:52:53,013 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2018-12-24 13:52:53,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:53,013 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-24 13:52:53,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:52:53,013 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-24 13:52:53,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-24 13:52:53,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-24 13:52:53,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:53,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:53,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:53,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:53,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:53,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:53,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:53,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:53,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:53,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:53,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:53,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:53,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:53,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:53,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:53,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:53,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:53,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:53,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:53,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:53,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:53,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:53,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:53,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:54,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:54,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:54,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:54,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:55,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:55,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:55,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:55,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:55,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:55,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:55,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:55,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:55,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:55,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:55,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:55,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:55,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:55,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:56,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:56,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:56,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:56,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:56,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:56,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:56,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:57,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:57,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:57,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:57,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:57,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:57,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:57,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:57,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:57,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:57,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:57,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:57,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:57,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:58,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:58,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:58,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:58,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:58,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:58,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:58,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:59,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:59,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:59,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:59,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:52:59,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:53:00,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:53:00,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:53:00,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:53:01,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:53:01,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:53:01,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:53:01,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:53:01,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:53:01,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:53:01,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:53:02,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:53:02,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:53:02,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:53:03,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:53:03,339 WARN L181 SmtUtils]: Spent 10.31 s on a formula simplification. DAG size of input: 1855 DAG size of output: 1101 [2018-12-24 13:53:17,426 WARN L181 SmtUtils]: Spent 14.07 s on a formula simplification. DAG size of input: 1000 DAG size of output: 85 [2018-12-24 13:53:17,429 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2018-12-24 13:53:17,430 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 43) no Hoare annotation was computed. [2018-12-24 13:53:17,430 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-12-24 13:53:17,430 INFO L448 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2018-12-24 13:53:17,430 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 44) no Hoare annotation was computed. [2018-12-24 13:53:17,430 INFO L444 ceAbstractionStarter]: At program point L36-1(lines 31 41) the Hoare annotation is: (let ((.cse18 (select |#memory_int| ULTIMATE.start_main_p4)) (.cse8 (select |#memory_int| ULTIMATE.start_main_p2))) (let ((.cse10 (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse8 (- 1)))) (.cse6 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse17 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse18 (- 1)))) (.cse19 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse7 (= .cse18 0)) (.cse5 (<= 0 .cse19)) (.cse2 (select .cse17 ULTIMATE.start_main_p3)) (.cse4 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse6 1))) (.cse0 (<= (+ ULTIMATE.start_main_p1 3) ULTIMATE.start_main_p4)) (.cse3 (= 0 (select .cse10 ULTIMATE.start_main_p1))) (.cse1 (= 0 (select .cse17 ULTIMATE.start_main_p2))) (.cse13 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (.cse9 (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse19 1)))) (or (and (and (and .cse0 .cse1) (<= 1 .cse2) .cse3) (<= (+ (select .cse4 ULTIMATE.start_main_p4) 1) 0)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) .cse5 (<= 0 .cse6) .cse7 (<= .cse8 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (let ((.cse11 (select .cse4 ULTIMATE.start_main_p2))) (let ((.cse14 (<= .cse18 0)) (.cse15 (<= (+ .cse11 1) 0)) (.cse12 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))) (or (and (= 0 (select .cse9 ULTIMATE.start_main_p1)) (<= 1 (select .cse10 ULTIMATE.start_main_p3)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (= 0 .cse11) .cse0 .cse7) (and (and .cse12 .cse13 .cse14 .cse5 .cse15 .cse3) (not (= ULTIMATE.start_main_p4 ULTIMATE.start_main_p3))) (and (and .cse14 (let ((.cse16 (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 1 (select .cse17 ULTIMATE.start_main_p1)) .cse12))) (or (and .cse1 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) .cse16) (and .cse15 .cse16)))) (<= 0 .cse2))))) (and .cse0 .cse3 .cse1 (= .cse19 0) .cse13 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (<= (+ (select .cse9 ULTIMATE.start_main_p4) 1) 0)))))) [2018-12-24 13:53:17,430 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2018-12-24 13:53:17,430 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 45) no Hoare annotation was computed. [2018-12-24 13:53:17,431 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 46) no Hoare annotation was computed. [2018-12-24 13:53:17,431 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 48) no Hoare annotation was computed. [2018-12-24 13:53:17,431 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-12-24 13:53:17,447 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 01:53:17 BoogieIcfgContainer [2018-12-24 13:53:17,447 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-24 13:53:17,448 INFO L168 Benchmark]: Toolchain (without parser) took 84721.10 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -809.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-12-24 13:53:17,448 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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 13:53:17,449 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.32 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 13:53:17,449 INFO L168 Benchmark]: Boogie Preprocessor took 25.62 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 13:53:17,449 INFO L168 Benchmark]: RCFGBuilder took 294.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-24 13:53:17,449 INFO L168 Benchmark]: TraceAbstraction took 84327.77 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -830.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-12-24 13:53:17,450 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.32 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 25.62 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 294.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 84327.77 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -830.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 46]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 43]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 45]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 44]: 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: 31]: Loop Invariant Derived loop invariant: ((((((p1 + 3 <= p4 && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) || ((((((p3 < p4 && p2 < p3) && 0 <= #memory_int[p3]) && 0 <= #memory_int[p1]) && #memory_int[p4] == 0) && #memory_int[p2] <= 0) && p1 < p2)) || ((((((0 == #memory_int[p3 := #memory_int[p3] + 1][p1] && 1 <= #memory_int[p2 := #memory_int[p2] + -1][p3]) && !(p2 == p4)) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) && p1 + 3 <= p4) && #memory_int[p4] == 0) || ((((((!(p1 == p4) && !(p1 == p3)) && #memory_int[p4] <= 0) && 0 <= #memory_int[p3]) && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && !(p4 == p3))) || ((#memory_int[p4] <= 0 && (((0 == #memory_int[p4 := #memory_int[p4] + -1][p2] && !(p2 == p3)) && (!(p1 == p2) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p4)) || (#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])) || ((((((p1 + 3 <= p4 && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && #memory_int[p3] == 0) && !(p1 == p3)) && !(p3 == p2)) && #memory_int[p3 := #memory_int[p3] + 1][p4] + 1 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 4 error locations. SAFE Result, 84.2s OverallTime, 57 OverallIterations, 2 TraceHistogramMax, 21.7s AutomataDifference, 0.0s DeadEndRemovalTime, 24.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 210 SDtfs, 857 SDslu, 1 SDs, 0 SdLazy, 8790 SolverSat, 608 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 875 GetRequests, 174 SyntacticMatches, 38 SemanticMatches, 663 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2487 ImplicationChecksByTransitivity, 19.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=367occurred in iteration=46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 43 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 57 MinimizatonAttempts, 1522 StatesRemovedByMinimization, 56 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 64 NumberOfFragments, 342 HoareAnnotationTreeSize, 1 FomulaSimplifications, 181006621 FormulaSimplificationTreeSizeReduction, 10.3s HoareSimplificationTime, 1 FomulaSimplificationsInter, 10044512 FormulaSimplificationTreeSizeReductionInter, 14.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 31.9s InterpolantComputationTime, 648 NumberOfCodeBlocks, 648 NumberOfCodeBlocksAsserted, 129 NumberOfCheckSat, 802 ConstructedInterpolants, 235 QuantifiedInterpolants, 90984 SizeOfPredicates, 162 NumberOfNonLiveVariables, 1237 ConjunctsInSsa, 390 ConjunctsInUnsatCore, 165 InterpolantComputations, 7 PerfectInterpolantSequences, 158/841 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...